-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeftRotateOfAnArray.java
More file actions
54 lines (40 loc) · 1.17 KB
/
LeftRotateOfAnArray.java
File metadata and controls
54 lines (40 loc) · 1.17 KB
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package Testing;
import java.util.Arrays;
import java.util.Scanner;
public class LeftRotateOfAnArray {
public static void main(String[] args) {
System.out.println("Enter the number of elements in an array");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("enter elements");
for (int i = 0; i < n; i++)
{
Scanner sca = new Scanner(System.in);
arr[i] = sca.nextInt();
}
System.out.println("Enter the number of rotations");
Scanner scr = new Scanner(System.in);
int r = scr.nextInt();
int[] result =LeftRotate(arr, r);
for (int i =0; i < n ; i++)
{
System.out.println(result[i]);
}
}
public static int [] LeftRotate(int[] arr, int r)
{
int j;
for(int i = 0 ; i < r; i++ )
{
int temp = arr[0];
for(j=0;j <arr.length-1; j++)
{
arr[j] = arr[j+1];
}
arr[arr.length -1] = temp;
}
System.out.println(Arrays.toString(arr));
return arr;
}
}