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

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

 

相关文章:

  • 2022-12-23
  • 2021-10-07
  • 2021-05-02
  • 2021-11-14
  • 2021-10-13
  • 2021-06-15
  • 2021-11-19
  • 2022-01-15
猜你喜欢
  • 2021-06-16
  • 2022-02-21
  • 2021-10-13
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案