【leetcode59】spiral matrix ii 螺旋矩阵 ii

“The Linux philosophy is “Laugh in the face of danger”.Oops.Wrong One. “Do it yourself”. Yes, that”s it.”
Linux的哲学就是“在危险面前放声大笑”,呵呵,不是这句,应该是“一切靠自己,自力更生”才对。

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

* 给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
*/

public class {

public int[][] generateMatrix(int n) {
int[][] res = new int[n][n];
int up = 0, down = n - 1, right = n - 1, left = 0;
int num = 1;
for (; ; ) {
for (int i = left; i <= right; i++) {
res[up][i] = num++;
}
if (++up > down)
break;
for (int i = up; i <= down; i++) {
res[i][right] = num++;
}
if (--right < left)
break;
for (int i = right; i >= left; i--) {
res[down][i] = num++;
}
if (--down < up)
break;
for (int i = down; i >= up; i--)
res[i][left] = num++;
if (++left > right)
break;
}
return res;
}
}