lc螺旋矩阵类问题

最新推荐文章于 2024-07-05 11:05:05 发布

kirei12315

最新推荐文章于 2024-07-05 11:05:05 发布

阅读量69

点赞数

文章标签：矩阵算法 c++

本文链接：https://blog.csdn.net/kirei12315/article/details/130628381

版权

59 螺旋矩阵Ⅱ：

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n,vector<int>(n,0));
        int startx = 0;
        int starty = 0;
        int loop = n / 2;
        int count = 1;
        int offset = 1;
        int mid = n / 2; 
        int i,j;
        while(loop--){
            i = startx;
            j = starty;
            for( j = starty; j < n - offset;j++){
            res[startx][j] = count++;
        }
            for( i = startx; i < n - offset;i++){
                res[i][j] = count++;
            }
            for(; j > starty ;j--){
                res[i][j] = count++;
            }
            for(; i > startx ;i--){
                res[i][j] = count++;
            }
            startx+= 1;
            starty+= 1;
            offset+= 1;
        }
        if (n % 2) {
            res[mid][mid] = count;
        }
        return res;
    }
};

54 螺旋矩阵：

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> res;
        int m = sizeof(matrix);
        int n = sizeof(matrix[0]);
        int offset = 1;
        int left = 0; 
        int right = m;
        int top = 0;
        int bottom = n;
        int i,j;
        while(left < right && top < bottom){
            for(j = left; j < right - offset;j++){
                res.push_back(matrix[left][j]);
            }
            for(i = top; i < bottom - offset; i++){
                res.push_back(matrix[i][j]);
            }
            for(; j > left;j--){
                res.push_back(matrix[i][j]);
            }
            for(;i > top;i--){
                res.push_back(matrix[i][j]);
            }
            left++;
            top++;
            right--;
            bottom--;
            offset++;
        }
        return res;

    }
};