-
Notifications
You must be signed in to change notification settings - Fork 35
/
CyclicRotation.java
99 lines (75 loc) · 2.13 KB
/
CyclicRotation.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
93
94
95
96
97
98
99
package com.codility.lessons.Arrays;
import java.util.Arrays;
/**
*/
public class CyclicRotation {
public static void main(String[] args) {
//https://codility.com/demo/results/trainingUBWFTE-G5D/
int[] A = {-3, 8, 9, -7, 6} ;
int K = 3;
int[] sol1 = solution1(A,K);
System.out.println("sol1-->"+Arrays.toString(sol1));
int[] sol2 = solution2(A,K);
System.out.println("sol2-->"+Arrays.toString(sol2));
int[] sol3 = solution3(A,K);
System.out.println("sol3-->"+Arrays.toString(sol3));
int[] sol4 = solution4(A,K);
System.out.println("sol4-->"+Arrays.toString(sol4));
}
public static int [] solution1(int [] A, int K) {
int size = A.length;
int ret[] = new int [size];
if (K < 0 || K > 100 || size == 0) {
return ret;
}
if (size == 1) {
return A;
}
for (int i = 0; i < size; i++) {
ret[(i + K) % size] = A[i];
//when i=0 then (0+3)=3 =>(3 modulo 5)= 3
}
return ret;
}
public static int [] solution2(int [] A, int K)
{
int N = A.length;
if (N==0)
return A;
if (K>=N)
K %= N;
if (K==0)
return A;
int [] rotA = new int [N];
for (int i=0; i<N; i++)
rotA[i] = (i<K) ? A[N+i-K] : A[i-K];
return rotA;
}
public static int[] solution3(int[] A, int K) {
int length = A.length;
if (length == 0) {
return A;
}
int[] result = new int[length];
int rIdx = 0;
int times = K % length;
int idx = length - times;
for (int i = idx; i < length; i++) {
result[rIdx] = A[i];
rIdx++;
}
for (int i = 0; i < idx; i++) {
result[rIdx] = A[i];
rIdx++;
}
return result;
}
public static int[] solution4(int[] A, int K) {
int[] result = new int[A.length];
for (int i = 0; i < result.length; i++) {
int newPosition = (i + K) % result.length;
result[newPosition] = A[i];
}
return result;
}
}