JAVA Left Rotation
JAVA Left Rotation
Problem Link : https://www.hackerrank.com/challenges/ctci-array-left-rotation
A left rotation operation on an array of size shifts each of the array’s elements unit to the left. For example, if left rotations are performed on array , then the array would become .
Given an array of integers and a number, , perform left rotations on the array. Then print the updated array as a single line of space-separated integers.
Input Format
The first line contains two space-separated integers denoting the respective values of (the number of integers) and (the number of left rotations you must perform).
The second line contains space-separated integers describing the respective elements of the array’s initial state.
Output Format
Print a single line of space-separated integers denoting the final state of the array after performing left rotations.
Sample Input
1 2 3 |
5 4 1 2 3 4 5 |
Sample Output
1 2 |
5 1 2 3 4 |
Explanation
When we perform left rotations, the array undergoes the following sequence of changes:
Thus, we print the array’s final state as a single line of space-separated values, which is 5 1 2 3 4
.
Solution Code :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 |
import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static int[] arrayLeftRotation(int[] a, int n, int k) { int tmp; for (int i=0;i<k;i++) { tmp=a[0]; for (int j=0;j<n-1;j++) { a[j]=a[j+1]; } a[n-1]=tmp; } return a; } public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int k = in.nextInt(); int a[] = new int[n]; for(int a_i=0; a_i < n; a_i++){ a[a_i] = in.nextInt(); } int[] output = new int[n]; output = arrayLeftRotation(a, n, k); for(int i = 0; i < n; i++) System.out.print(output[i] + " "); System.out.println(); } } |