-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArraysQuestions.java
More file actions
64 lines (48 loc) · 1.08 KB
/
ArraysQuestions.java
File metadata and controls
64 lines (48 loc) · 1.08 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
55
56
57
58
59
60
61
62
63
64
public class ArraysQuestions {
static int me=0;
static int a(){
return 2;
}
//me = 20;
{
me = a();
}
public static void main(String[] args) {
int p=20;
p=30;
System.out.println(p);
me = 30;
System.out.println(me);
ArraysQuestions.me=20;
}
int[] rotateArray1(int[] arr, int k)
{
int[] temp = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
temp[(i + k) % arr.length] = arr[i];
} return temp;
}
void reverse(int[] arr, int start, int end) {
while (start < end) {
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
public static void reverseArray(int[] arr) {
int temp;
for (int i = 0; i < arr.length / 2; i++) {
temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
void rotateArray(int[] arr, int k) {
k = k % arr.length;
reverse(arr, 0, arr.length - 1);
reverse(arr, 0, k - 1);
reverse(arr, k, arr.length - 1);
}
}