输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 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]
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
"""
1 2 3
4 5 6
7 8 9
"""
res = []
m = len(matrix)
if m==0:
return res
n = len(matrix[0])
if n==0:
return res
up = 0
down = m-1
left = 0
right = n-1
while up<=down and left<=right:
for col in range(left,right+1):
res.append(matrix[up][col])
up+=1
for row in range(up,down+1):
res.append(matrix[row][right])
right-=1
if up>down or left>right:
break
for col in range(right,left-1,-1):
res.append(matrix[down][col])
down-=1
for row in range(down,up-1,-1):
res.append(matrix[row][left])
left+=1
return res