LetCode 59. 螺旋矩阵 II

最新推荐文章于 2021-02-19 21:12:09 发布

吴贝贝97

最新推荐文章于 2021-02-19 21:12:09 发布

阅读量178

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/wbb1997/article/details/81003112

版权

LeetCode 专栏收录该内容

127 篇文章 0 订阅

订阅专栏

static int x=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();
class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n, vector<int>(n));
        // 这里分别用4个变量记录矩阵的4个顶点
        int Left = 0, Right = n - 1, Top = 0, Bottom = n - 1;
        int count = 1;
        while(count <= n * n){
            for (int i = Left; i <= Right && count <= n * n; i++)
                res[Top][i] = count++;
            for (int i = Top + 1; i <= Bottom && count <= n * n; i++)
                res[i][Right] = count++;
            for (int i = Right - 1; i >= Left && count <= n * n; i--)
                res[Bottom][i] = count++;
            for (int i = Bottom - 1; i > Top && count <= n * n; i--)
                res[i][Left] = count++;
            Left++;
            Right--;
            Top++;
            Bottom--;
        }
        return res;
    }
};