题目:
给定一个包含 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 = list()
if not matrix or len(matrix) == 0:
return matrix
r,c = len(matrix),len(matrix[0])
x1,x2,y1,y2 = 0,r-1,0,c-1
while x1<=x2 and y1<=y2:
for j in range(y1,y2+1):
res.append(matrix[x1][j])
for i in range(x1+1,x2+1):
res.append(matrix[i][y2])
if x1<x2 and y1<y2:
for j in range(y2-1,y1-1,-1):
res.append(matrix[x2][j])
for i in range(x2-1,x1,-1):
res.append(matrix[i][y1])
x1+=1
y1+=1
x2-=1
y2-=1
return res