-
Notifications
You must be signed in to change notification settings - Fork 7
/
RotateArray.java
78 lines (62 loc) · 1.92 KB
/
RotateArray.java
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
//https://practice.geeksforgeeks.org/problems/rotate-array-by-n-elements-1587115621/1?utm_source=geeksforgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab
//{ Driver Code Starts
//Initial Template for Java
import java.util.*;
import java.io.*;
import java.lang.*;
class GFG
{
public static void main(String args[])throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out=new PrintWriter(System.out);
//taking testcases
int t = Integer.parseInt(br.readLine());
for(int i=0;i<t;i++)
{
String str=br.readLine();
String[] starr=str.split(" ");
//input n and d
int n=Integer.parseInt(starr[0]);
int d= Integer.parseInt(starr[1]);
int[] arr=new int[n];
String str1=br.readLine();
String[] starr1=str1.split(" ");
//inserting elements in the array
for(int j=0;j<n;j++)
{
arr[j]= Integer.parseInt(starr1[j]);
}
//calling rotateArr() function
new Solution().rotateArr(arr, d, n);
StringBuffer sb=new StringBuffer();
//printing the elements of the array
for(int t1=0;t1<n;t1++)
sb.append(arr[t1]+" ");
out.println(sb);
}
out.close();
}
}
// } Driver Code Ends
//User function Template for Java
class Solution
{
//Function to rotate an array by d elements in counter-clockwise direction.
static void rotateArr(int arr[], int d, int n)
{
// add your code here
d=d%n;
rotate(arr,0,d-1);
rotate(arr,d,n-1);
rotate(arr,0,n-1);
}
public static void rotate(int[] arr,int si, int ei){
while(si<ei){
int temp = arr[si];
arr[si]=arr[ei];
arr[ei]=temp;
si++;ei--;
}
}
}