LeetCode 59. 螺旋矩阵 II

Corux

已于 2022-09-20 19:51:23 修改

阅读量238

点赞数

分类专栏：没事做做算法题文章标签： leetcode 矩阵算法

于 2022-09-20 19:50:18 首次发布

本文链接：https://blog.csdn.net/kku101xyz/article/details/126960258

版权

没事做做算法题专栏收录该内容

30 篇文章 7 订阅

订阅专栏

https://leetcode.cn/problems/spiral-matrix-ii/

代码（含注释）

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        if (n == 0) return vector<vector<int>>();
        vector<vector<int>> arr(n);
        for (vector<int>& R : arr) R = move(vector<int>(n));

        int num = 0;
        int fr = 0, lr, fc = 0, lc; //first_row=0, first_column=0
        for (; n > 1; n -= 2) {
            lr = fr + n - 1;    //last_row = first_row + n - 1
            lc = fc + n - 1;    //last_column = first_column + n - 1
            for (int c = fc; c < lc; ++c)      //first row: fc ~ lc-1
                arr[fr][c] = ++num;
            for (int r = fr; r < lr; ++r)  //last column: fr ~ lr-1
                arr[r][lc] = ++num;
            for (int c = lc; c > fc; --c)  //last row: lc ~ fc+1
                arr[lr][c] = ++num;
            for (int r = lr; r > fr; --r)   //first column: lr ~ fr+1
                arr[r][fc] = ++num;
            ++fr;
            ++fc;
        }
        n ? arr[fr][fc] = ++num : 0;
        return arr;
    }
};