59 Spiral Matrix II

1 题目

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

2 尝试解

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> result;
        for(int i = 0; i < n; i++){
            vector<int> temp(n,0);
            result.push_back(temp);
        }
        int up = 0;
        int down = n-1;
        int right = n-1;
        int left =0;
        int num = 1;
        int dir = 0;
        while(up<=down && left<=right){
            if(dir % 4 == 0){ //toward right
                for(int i = left; i <= right; i++){
                    result[up][i] = num;
                    num++;
                }
                dir++;
                up++;
            }
            else if(dir % 4 == 1){ //toward down
                for(int i = up; i <= down; i++){
                    result[i][right] = num;
                    num++;
                }
                dir++;
                right--;
            }
            else if(dir % 4 == 2){ //toward left
                for(int i = right; i >= left; i--){
                    result[down][i] = num;
                    num++;
                }
                dir++;
                down--;
            }
            else { //toward up
                for(int i = down; i >= up; i--){
                    result[i][left] = num;
                    num++;
                }
                dir++;
                left++;
            }
        }
        return result;
    }
};

3 标准解

class Solution {
    public:
        vector<vector<int> > generateMatrix(int n) {
            vector<vector<int> > ret( n, vector<int>(n) );
        	int k = 1, i = 0;
        	while( k <= n * n )
        	{
        		int j = i;
                    // four steps
        		while( j < n - i )             // 1. horizonal, left to right
        			ret[i][j++] = k++;
        		j = i + 1;
        		while( j < n - i )             // 2. vertical, top to bottom
        			ret[j++][n-i-1] = k++;
        		j = n - i - 2;
        		while( j > i )                  // 3. horizonal, right to left 
        			ret[n-i-1][j--] = k++;
        		j = n - i - 1;
        		while( j > i )                  // 4. vertical, bottom to  top 
        			ret[j--][i] = k++;
        		i++;      // next loop
        	}
        	return ret;
        }
    };