螺旋矩阵

螺旋矩阵

leetcode
给定一个包含 m x n 个元素的矩阵（m 行, n 列），请按照顺时针螺旋顺序，返回矩阵中的所有元素。

示例 1:

输入:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]
示例 2:

输入:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
输出: [1,2,3,4,8,12,11,10,9,5,6,7]

思路和代码

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> res;
        if(matrix.size()==0)
            return res;
        int tr = 0;
        int tc = 0;
        int dr = matrix.size()-1;
        int dc = matrix[0].size()-1;
        while(tr<=dr && tc<=dc)
        {
            for(int curc=tc; curc<=dc; curc++)
                res.push_back(matrix[tr][curc]);
            for(int curr=tr+1; curr<=dr; curr++)
                res.push_back(matrix[curr][dc]);
            if(tr<dr && tc<dc)
            {
                for(int curc=dc-1; curc>tc; curc--)
                    res.push_back(matrix[dr][curc]);
                for(int curr=dr; curr>tr; curr--)
                    res.push_back(matrix[curr][tc]);
            }
            tr++;
            tc++;
            dr--;
            dc--;
        }
        return res;
    }
};

螺旋矩阵

leetcode
给定一个正整数 n，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的正方形矩阵。

示例:

输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]

思路和代码

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int> > matrix(n,vector<int>(n,0));
        int ar = 0;
        int ac = 0;
        int br = n-1;
        int bc = n-1;
        int count = 1;
        while(ar<=br && ac<=bc)
        {
            for(int curc=ac; curc<=bc; curc++)
            {
                matrix[ar][curc] = count;
                count++;
            }
            for(int curr=ar+1; curr<=br; curr++)
            {
                matrix[curr][bc] = count;
                count++;
            }
            for(int curc=bc-1; curc>=ac; curc--)
            {
                matrix[br][curc] = count;
                count++;
            }
            for(int curr=br-1; curr>ar; curr--)
            {
                matrix[curr][ac] = count;
                count++;
            }
            ar++;
            ac++;
            br--;
            bc--;
        }
        return matrix;
    }
};