【LeetCode】59. Spiral Matrix II

题目：

Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

Example:

Input: 3
Output:
[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

 

描述:

给出一个n表示要生成一个n*n的矩阵，矩阵中的元素从1-n^2 按照顺时针螺旋排列

 

分析：

与之前某道题（点这里）类似，只是稍微修改了一下控制的条件

 

代码：（时间空间复杂度均为O（n^2））

class Solution {
public:
	vector<vector<int>> generateMatrix(int n) {
		vector<vector<bool>> visit;
		vector<vector<int>> result;
		init(n, visit, result);
		
		int cnt = n * n, current = 1, i = 0, j = 0;
		
		while (cnt) {
			while (j < n && !visit[i][j]) {
				result[i][j] = current;
				visit[i][j] = true;
				++ j;
				-- cnt, ++ current;
			}
			++ i, -- j;
			
			while (i < n && !visit[i][j]) {
				result[i][j] = current;
				visit[i][j] = true;
				++ i;
				-- cnt, ++ current;
			}
			-- i, -- j;
			
			while (j >= 0 && !visit[i][j]) {
				result[i][j] = current;
				visit[i][j] = true;
				-- j;
				-- cnt, ++ current;
			}
			-- i, ++ j;
			
			while (i >= 0 && !visit[i][j]) {
				result[i][j] = current;
				visit[i][j] = true;
				-- i;
				-- cnt, ++ current;
			}
			++ i, ++ j;
		}
		return result;
	}
	
	void init(int n, vector<vector<bool>> &visit, vector<vector<int>> &result) {
		for (int i = 0; i < n; ++ i) {
			vector<bool> temp;
			vector<int> num;
			for (int j = 0; j < n; ++ j) {
				temp.push_back(false);
				num.push_back(0);
			}
			visit.push_back(temp);
			result.push_back(num);
		}
	}
};