Leetcode 59. 螺旋矩阵 II

JehanRio

已于 2023-09-14 10:37:18 修改

阅读量53

点赞数

分类专栏： Leetcode专栏文章标签： leetcode 矩阵算法

于 2023-07-04 19:44:58 首次发布

本文链接：https://blog.csdn.net/weixin_51322383/article/details/131541806

版权

Leetcode专栏专栏收录该内容

278 篇文章 0 订阅

订阅专栏

文章目录

题目
代码（首刷自解）
代码（9.14 二刷自解）

题目

在这里插入图片描述
Leetcode 59. 螺旋矩阵 II

代码（首刷自解）

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n, vector<int>(n));
        int left = 0, right = n - 1, up = 0, down = n - 1;
        n = n * n;
        
        int ans = 1;
        while(ans <= n) {
            for(int i = left; i <= right; i++) {
                // if(ans <= n)
                    res[up][i] = ans++;
            }
            up++;
            for(int i = up; i <= down; i++) {
                // if(ans <= n)
                    res[i][right] = ans++;
            }
            right--;
            for(int i = right; i >= left; i--) {
                // if(ans <= n)
                    res[down][i] = ans++;
            }
            down--;
            for(int i = down; i >= up; i--) {
                // if(ans <= n)
                    res[i][left] = ans++;
            }
            left++;  
        }
        return res;
    }
};

代码（9.14 二刷自解）

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n, vector<int>(n));
        int left = 0, right = n-1, up = 0, down = n-1;
        int i = 1;
        while(i <= n*n) {
            if(i <= n*n) {
                 for(int j = left; j <= right; j++) {
                    res[up][j] = i++;cout<< res[up][j]<<" ";
                }
                up++;
            }
            if(i <= n*n) {
                for(int j = up; j <= down; j++) {
                    res[j][right] = i++;
                }
                right--;
            }
            if(i <= n*n) {
                for(int j = right; j >= left; j--) {
                    res[down][j] = i++;
                }   
                down--;
            }
            if(i <= n*n) {
                for(int j = down; j >= up; j--) {
                    res[j][left] = i++;
                }
                left++;
            }
        }
        return res;
    }
};