2022-7-8 Leetcode 59.螺旋矩阵 II

最新推荐文章于 2024-10-12 23:06:01 发布

weixin_51187533

最新推荐文章于 2024-10-12 23:06:01 发布

阅读量59

点赞数

分类专栏：力扣刷题记录文章标签： leetcode 矩阵算法

原文链接：https://programmercarl.com/0059.%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II.html#%E6%80%9D%E8%B7%AF

版权

力扣刷题记录专栏收录该内容

273 篇文章 0 订阅

订阅专栏

在这里插入图片描述

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> matrix(n, vector<int>(n, 0));
        int startx = 0, starty = 0;
        int loop = n / 2;//大外圈循环的次数
        int mid = n / 2;
        int count = 1;
        int offset = 1;
        int i, j;
        while (loop--){
            i = startx;
            j = starty;

            for (j = starty; j < n - offset; j++){
                matrix[startx][j] = count;
                count++;
            }

            for (i = startx; i < n - offset; i++){
                matrix[i][j] = count;
                count++;
            }

            for (; j > starty; j--){
                matrix[i][j] = count;
                count++;
            }

            for (; i > startx; i--){
                matrix[i][j] = count;
                count++;
            }

            offset++;
            startx++;
            starty++;
        }

        if ((n & 1) == 1){
            matrix[mid][mid] = count;
        }
        return matrix;
    }
};