-
Notifications
You must be signed in to change notification settings - Fork 0
/
RightRotation.java
92 lines (67 loc) · 1.66 KB
/
RightRotation.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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/* Alternative short solution for right rotation
import java.util.*;
class RightRotation {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String[] arr = in.nextLine().split(" ");
int dfr = in.nextInt();
String[] out = new String[arr.length];
if(dfr>arr.length) {
dfr %= arr.length;
}
for(String a : arr) {
if(dfr>arr.length-1) {
dfr = 0;
}
out[dfr] = a;
dfr++;
}
for(String a : out) {
System.out.print(a+" ");
}
}
}
*/
import java.util.*;
class RightRotation {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String str = in.nextLine();
int n = in.nextInt();
String[] arr = str.split(" ");
int length = arr.length;
length = Math.abs(n%length);
if(n>length) {
n = length;
}
String[] arr1 = new String[n];
String[] arr2 = new String[n];
String[] merge = new String[arr.length];
String[] cut = new String[Math.abs(arr.length-n)];;
int l =0;
int k = (arr.length-n)-1;
for(int i = 0;i<=k;i++) {
cut[i] = arr[l];
l++;
}
int len = arr.length-1;
for(int i=0;i<n;i++) {
arr1[i] = arr[len-i];
}
for(int i=0;i<n;i++) {
arr2[i] = arr1[(n-i)-1];
}
int i =0;
for(String a: arr2) {
merge[i] = a;
i++;
}
for(String a: cut) {
merge[i] = a;
i++;
}
for(String a : merge) {
System.out.print(a+" ");
}
}
}