Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
48 lines (41 loc) · 1.05 KB

File metadata and controls

48 lines (41 loc) · 1.05 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms;
public class SpiralMatrix {
public int[][] generateMatrix(int n) {
int[][] rst = new int[n][n];
generateHelp(0, 1, rst, n);
return rst;
}
private void generateHelp(int level, int beginNumber, int[][] rst, int n) {
if (n % 2 == 0) {
if (level == n/2) {
return;
}
} else {
if (level > n/2) {
return;
}
}
int right = n - 1 - level;
int num = beginNumber;
int i = level, j = level;
// go through the first line.
while (j <= right) {
rst[i][j] = num;
num++;
j++;
}
while (i <= right) {
rst[i][j] = num;
num++;
i++;
}
while (j > level) {
rst[i][j] = num;
num++;
j--;
}
// go to the next level;
generateHelp(level + 1, num, rst, n);
return;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.