Description
Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
Example 1
Input: 3
Output:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
Solution 1(C++)
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n, vector<int>(n, 0));
int init=1, total=n*n, cur=0, x=0, y=0;
int dir[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
while(init <= total){
if(res[x][y] == 0){
res[x][y] = init;
init += 1;
}
if( x+dir[cur%4][0]>=n || x+dir[cur%4][0]<0 || y+dir[cur%4][1]>=n || y+dir[cur%4][1]<0 ){
cur += 1;
}
else if(res[x+dir[cur%4][0]][y+dir[cur%4][1]] != 0){
cur += 1;
}
else {
x += dir[cur%4][0];
y += dir[cur%4][1];
}
}
return res;
}
};
算法分析
仔细分析一下就可以得出结果。这道题不难。
程序分析
略。