-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMatrixSimiliarity.java
91 lines (72 loc) · 1.55 KB
/
MatrixSimiliarity.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
import java.util.Arrays;
class MatrixShift {
public static void main(String args[]) {
int[][] arr = {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
};
int[][] arr1 = {
{1, 2, 1, 2},
{5, 5, 5, 5},
{6, 3, 6, 3}
};
int[][] arr2 = {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
};
// System.out.println(matrixoperation(arr2, 4));
matrixoperation(arr2, 4);
}
static void leftshift(int[] arr, int length) {
int temp=arr[0];
int j = 1;
while (j<length) {
arr[j-1] = arr[j];
j++;
}
arr[length-1] = temp;
}
static void rightshift(int[] arr, int length) {
int temp = arr[length-1];
int j = length - 1;
while (j>0) {
arr[j] = arr[j-1];
j--;
}
arr[0] = temp;
}
static boolean compare(int[][] matrix1, int[][] matrix2) {
int rows = matrix1.length;
int cols = matrix1[0].length;
for(int i=0;i<rows;i++) {
for(int j=0;j<cols;j++) {
if (matrix1[i][j] != matrix2[i][j]) return false;
}
}
return true;
}
static boolean matrixoperation(int[][] matrix, int k) {
int[][] copy = matrix.clone();
int rows = matrix.length;
int cols = matrix[0].length;
int rotate = k%cols;
for(int i=0;i<rows;i++) {
if (i%2==0) {
for(int j=0;j<rotate;j++) {
leftshift(matrix[i], cols);
// System.out.println(Arrays.toString(matrix[i]));
};
// System.out.println(Arrays.toString(matrix[i]));
}
else {
for(int j=0;j<rotate;j++) {
rightshift(matrix[i], cols);
// System.out.println(Arrays.toString(matrix[i]));
};
}
}
return compare(copy, matrix);
}
}