[Leetcode]螺旋矩阵Python

[Leetcode]螺旋矩阵

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:
    def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
        res = []
        m = len(matrix)
        if m == 0:
            return res
        n = len(matrix[0])
        rowbegin = 0
        colbegin = 0
        rowend = m - 1
        colend = n - 1
        while rowbegin <= rowend and colbegin <= colend:
            #向右
            for i in range(colbegin, colend + 1):
                res.append(matrix[rowbegin][i])
            rowbegin = rowbegin + 1  

            #向下
            for i in range(rowbegin, rowend + 1):
                res.append(matrix[i][colend])
            colend = colend - 1

            #向左 
            if rowbegin <= rowend:
                for i in range(colend, colbegin - 1, -1):
                    res.append(matrix[rowend][i])
                rowend = rowend - 1

            #向上
            if colbegin <= colend:
                for i in range(rowend, rowbegin - 1, -1):
                    res.append(matrix[i][colbegin])
                colbegin = colbegin + 1
        return res