Spiral Matrix

最新推荐文章于 2024-07-06 15:27:08 发布

原创最新推荐文章于 2024-07-06 15:27:08 发布 · 355 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

636 篇文章

订阅专栏

本文介绍了一种遍历矩阵元素的螺旋顺序算法，并通过示例代码演示了如何实现矩阵中元素的螺旋遍历。

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) {
        vector<int> result;
        if (matrix.size() == 0)
        {
            return result;
        }
        int left = 0;
        int top = 0;
        int bottom = matrix.size() - 1;
        int right = matrix[0].size() - 1;
        int row = 0;
        int column = 0;
        while (left <= right && top <= bottom)
        {
            if (column <= right)
            {
                while (column <= right)
                {
                    result.push_back(matrix[row][column]);
                    column++;
                }
                column--;
                top++;
                row++;
            }

            if (left <= right && top <= bottom && row <= bottom)
            {
                while (row <= bottom)
                {
                    result.push_back(matrix[row][column]);
                    row++;
                }
                row--;
                right--;
                column--;
            }

            if (left <= right && top <= bottom && column >= left)
            {
                while (column >= left)
                {
                    result.push_back(matrix[row][column]);
                    column--;
                }
                column++;
                bottom--;
                row--;
            }

            if (left <= right && top <= bottom && row >= top)
            {
                while (row >= top)
                {
                    result.push_back(matrix[row][column]);
                    row--;
                }
                row++;
                left++;
                column++;
            }
        }

        return result;
    }
};