54.螺旋矩阵
给你一个 m
行 n
列的矩阵 matrix
,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]] 输出:[1,2,3,6,9,8,7,4,5]
示例 2:
输入:matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]] 输出:[1,2,3,4,8,12,11,10,9,5,6,7]
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
result = []
for i in range(len(matrix)):
n = len(matrix)
m1 = len(matrix[n-1])
m2 = len(matrix[0])
for i in range(m2):
result.append(matrix[0][i])
matrix.pop(0)
for i in range(n-1):
if len(matrix[i]) != 0:
result.append(matrix[i].pop())
if n >= 2:
matrix[n-2].reverse()
for i in range(m1-1):
result.append(matrix[n-2][i])
matrix.pop(n-2)
j = n-3
while j >= 1:
if len(matrix[j])!= 0:
result.append(matrix[j].pop(0))
j -= 1
if len(matrix) == 0:
break
return result