Leetcode: Spiral Matrix

最新推荐文章于 2022-05-01 23:51:39 发布

Code Talk

最新推荐文章于 2022-05-01 23:51:39 发布

阅读量390

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/loushuai/article/details/38461755

版权

算法专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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].

Code:

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int> > &matrix) {
        vector<int> ret;
        int h = matrix.size();
        if (h == 0) return ret;
        int w = matrix[0].size();
        if (w == 0) return ret;
        
        int left = 0, right = w - 1, top = 0, bottom = h-1;
        
        int i = 0;
        int end = 1;
        while (1) {
            for (i = left; i <= right; ++i) {
                ret.push_back(matrix[top][i]);
                end = 0;
            }
            if (end) break;
            end = 1;
            for (i = top+1; i <= bottom; ++i) {
                ret.push_back(matrix[i][right]);
                end = 0;
            }
            if (end) break;
            end = 1;
            for (i = right-1; i >=left; --i) {
                ret.push_back(matrix[bottom][i]);
                end = 0;
            }
            if (end) break;
            end = 1;
            for (i = bottom-1; i > top; --i) {
                ret.push_back(matrix[i][left]);
                end = 0;
            }
            if (end) break;
            end = 1;
            ++left;
            --right;
            ++top;
            --bottom;
        }
        
        return ret;
    }
};