-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayMirroInverse.java
More file actions
62 lines (53 loc) · 1.28 KB
/
ArrayMirroInverse.java
File metadata and controls
62 lines (53 loc) · 1.28 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
package coding;
import java.util.Scanner;
public class ArrayMirroInverse {
public static void main(String[] args) {
int arr[];
arr = input(4);
dispaly(arr);
// rotateRight(arr, 3);
mirrorInverse(arr);
System.out.println();
dispaly(arr);
}
private static int[] input(int number) {
// TODO Auto-generated method stub
int arr[] = new int[number];
Scanner sc = new Scanner(System.in);
for (int i = 0; i < number; i++) {
arr[i] = sc.nextInt();
}
return arr;
}
public static void dispaly(int arr[]) {
System.out.print("[ ");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.print("]");
}
public static void reverseArray(int arr[]) {
for (int i = 0; i < arr.length / 2; i++) {
int temp = arr[i];
arr[i] = arr[arr.length - i - 1];
arr[arr.length - i - 1] = temp;
}
}
public static void rotateRight(int arr[], int rotation) {
rotation = rotation % arr.length;
if (rotation < 0)
rotation = arr.length - rotation;
for (int i = 0; i < rotation; i++) {
int temp = arr[arr.length - 1];
for (int j = arr.length - 1; j > 0; j--) {
arr[j] = arr[j - 1];
}
arr[0] = temp;
}
}
public static void mirrorInverse(int arr[]) {
for (int i = 0; i < arr.length; i++) {
arr[arr[i]] = i;
}
}
}