Java Program to Generate all rotations of a number

// Java implementation of the approach
class GFG 
{

// Function to return the count of digits of n
static int numberOfDigits(int n) 
{
    int cnt = 0;
    while (n > 0) 
    {
        cnt++;
        n /= 10;
    }
    return cnt;
}

// Function to print the left shift numbers
static void cal(int num)
{
    int digits = numberOfDigits(num);
    int powTen = (int) Math.pow(10, digits - 1);

    for (int i = 0; i < digits - 1; i++)
    {
        int firstDigit = num / powTen;

        // Formula to calculate left shift
        // from previous number
        int left = ((num * 10) + firstDigit) -
                    (firstDigit * powTen * 10);
                
        System.out.print(left + " ");
                
        // Update the original number
        num = left;
    }
}

// Driver Code
public static void main(String[] args) 
{
    int num = 1445;
    cal(num);
}
}

// This code is contributed by 
// PrinciRaj1992