HackerRank Cracking The Coding Interview #1

ArrayLeftRotationSolution.java

/**
 * Created by rook on 1/7/17.
 */

import java.util.*;

public class ArrayLeftRotationSolution {

    /*
    Renamed some variables to make it easier
    for me to follow the code
     */

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // Size of the array
        int n = scanner.nextInt();
        // Number of rotations
        int k = scanner.nextInt();
        // Array
        int a[] = new int[n];

        // Creates the array from k number
        // of console inputs
        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();
        }

        a = rotate(a, n, k);

        for (int item : a) {
            System.out.print(item + " ");
        }
    }

    private static int[] rotate(int[] a, int n, int k) {
        int[] solution = a;
        int temp;
        int rotations = 0;

        while (rotations < k) {
            rotations++;
            temp = solution[0];
            for (int i = 0; i < solution.length - 1; i++) {
                solution[i] = solution[i + 1];
            }
            solution[solution.length-1] = temp;
        }
        return solution;
    }
}