Leetcode之Spiral MatrixII

题目：

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 ]
]

代码：

方法一（使用bool数组）：

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        	vector<vector<int> > res;
	if (n <= 0)return res;
	if (n == 1) {
		vector<int> v = { 1 };
		res.push_back(v);
		return res;
	}
	res = vector<vector<int>>(n, vector<int>(n, 0));
	vector<vector<bool> > v(n, vector<bool>(n, false));
	int value = 1;

	for (int i = 0, j = 0; !v[i][j];) {
		while (j < n && !v[i][j]) {
			res[i][j] = value;
			v[i][j] = true;
			value++;
			j++;
		}
		j--; i++;
		while (i < n && !v[i][j]) {
			res[i][j] = value;
			v[i][j] = true;
			value++;
			i++;
		}
		i--; j--;
		while (j >= 0 && !v[i][j]) {
			res[i][j] = value;
			v[i][j] = true;
			value++; j--;
		}
		j++; i--;
		while (i >= 0 && !v[i][j]) {
			res[i][j] = value;
			v[i][j] = true;
			value++; i--;
		}
		i++; j++;
	}

	return res;
    }
};

方法二（不使用布尔数组）：

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        		vector<vector<int> > res;
	if (n <= 0)return res;
	if (n == 1) {
		vector<int> v = { 1 };
		res.push_back(v);
		return res;
	}
	res = vector<vector<int>>(n, vector<int>(n, 0));
	
	int value = 1;
	
	for (int i = 0, j = 0;res[i][j]==0;) {
		while (j < n && res[i][j] == 0) {
			res[i][j] = value;		
			value++;
			j++;
		}
		j--; i++;
		while (i < n && res[i][j] == 0) {
			res[i][j] = value;
			
			value++;
			i++;
		}
		i--; j--;
		while (j >= 0 && res[i][j] == 0) {
			res[i][j] = value;
			
			value++; j--;
		}
		j++; i--;
		while (i >= 0 && res[i][j] == 0) {
			res[i][j] = value;
			value++; i--;
		}
		i++; j++;
	}

	return res;
    }
};

想法：有时候解一道题的时候可以想想有没有什么别的解法