LeetCode_54/59_螺旋矩阵

找到规律：每次循环分别遍历上、右、下、左四条边即可

54.

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int left=0,right,up=0,down,i;
		vector<int> ans;
		down=matrix.size();
		if(down==0)
			return ans;
		right=matrix[0].size();
		if(right==0)
			return ans;
		while(left<right && up<down)
		{
			for(i=left;i<right;i++)
				ans.push_back(matrix[up][i]);
			up++;
			for(i=up;i<down;i++)
				ans.push_back(matrix[i][right-1]);
			right--;
			if(left>=right || up>=down)
				break;
			for(i=right-1;i>=left;i--)
				ans.push_back(matrix[down-1][i]);
			down--;
			for(i=down-1;i>=up;i--)
				ans.push_back(matrix[i][left]);
			left++;
		}
		return ans;
    }
};

59.

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        int left=0,right=n,up=0,down=n,i,cnt=0,limit=n*n;
		vector<vector<int>> ans(n);
		if(n==0) return ans;
		for(i=0;i<n;i++)
		{
			vector<int> v(n);
			ans[i]=v;
		}
		while(cnt<limit)
		{
			if(left>=right || up>=down)
				break;
			for(i=left;i<right;i++)
				ans[up][i]=(++cnt);
			up++;
			for(i=up;i<down;i++)
				ans[i][right-1]=(++cnt);
			right--;
			if(left>=right || up>=down)
				break;
			for(i=right-1;i>=left;i--)
				ans[down-1][i]=(++cnt);
			down--;
			for(i=down-1;i>=up;i--)
				ans[i][left]=(++cnt);
			left++;
		}
		return ans;
    }
};