LeetCode题目:Spiral Matrix II

原题地址:https://leetcode.com/problems/spiral-matrix-ii/

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        if( == n){
            vector<vector<int>> coll;
            return coll;
        }
        vector<vector<int>> coll(n, vector<int>(n, ));
        int num = ;
        for(int i = ; i < n - ; ++i){
            for(int j = i; j < n - i; ++j)
                coll[i][j] = num++;
            for(int j = i + ; j < n - i; ++j)
                coll[j][n - i -] = num++;
            for(int j = n - i - ; j >= i; --j)
                coll[n - i - ][j] = num++;
            for(int j = n - i - ; j >= i + ; --j)
                coll[j][i] = num++;
        }
        return coll;
    }
};