-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathPrint-Matrix-Diagonally.java
45 lines (45 loc) · 1.17 KB
/
Print-Matrix-Diagonally.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
class Solution {
public int[] matrixDiagonally(int[][] mat) {
int i = 0, j = 0, k = 0;
int N = mat.length;
int[] res = new int[N * N];
int flag = 1;
while(k < N * N){
if(flag == 1){
while(i >= 0 && j < N){
res[k] = mat[i][j];
k++;
if(j == N - 1){
i++;
break;
}
else if(i == 0){
j++;
break;
}
i--;
j++;
}
flag = 0;
}
else{
while(i < N && j >= 0){
res[k] = mat[i][j];
k++;
if(i == N - 1){
j++;
break;
}
else if(j == 0){
i++;
break;
}
i++;
j--;
}
flag = 1;
}
}
return res;
}
}