LeetCode: Spiral Matrix

Tingmei

于 2012-10-08 15:50:08 发布

阅读量1.2k

点赞数

分类专栏：算法 C++ 文章标签： matrix layer function class

本文链接：https://blog.youkuaiyun.com/Tingmei/article/details/8048734

版权

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一种矩阵螺旋遍历的算法实现，该算法能够按螺旋顺序返回给定矩阵的所有元素。通过C++代码示例详细展示了如何针对不同大小的矩阵进行有效的螺旋遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]

You should return [1,2,3,6,9,8,7,4,5].

注意边界。

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> result;
        int m = matrix.size();
        if (m == 0) return result;
        int n = matrix[0].size();
        if (n == 0) return result;
        
        int min = (m < n ? m : n);
        int layer = min / 2;
        for (int i = 0; i < layer; ++i)
        {
            for (int j = i; j < n-1-i; ++j)
            {
                result.push_back(matrix[i][j]);
            }
            for (int j = i; j < m-1-i; ++j)
            {
                result.push_back(matrix[j][n-1-i]);
            }
            for (int j = n-1-i; j > i; --j)
            {
                result.push_back(matrix[m-1-i][j]);
            }
            for (int j = m-1-i; j > i; --j)
            {
                result.push_back(matrix[j][i]);
            }
        }
        if (min % 2 == 1)
        {
            if (m > n)
            {
                for (int i = layer; i <= m-1-layer; ++i)
                    result.push_back(matrix[i][n/2]);
            }
            else
            {
                for (int i = layer; i <= n-1-layer; ++i)
                    result.push_back(matrix[m/2][i]);
            }
        }
    }
};