问题:
给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
题解:
法一:遍历第一行元素,填充到结果列表,删除第一行元素,然后把矩阵逆时针翻转,重复此步骤直到获取到所有元素
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
res = []
for n in range(len(matrix)*len(matrix[0])):
for i in matrix[0]:
res.append(i)
matrix.remove(matrix[0])
if len(matrix) == 0:
break
matrix[::] = [[row[i] for row in matrix] for i in range(len(matrix[0]))][::-1]
return res
法二:设定矩阵上四个角的边界值,当触碰到边界时改变遍历的方向,直到获取到所有元素
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
M,N = len(matrix),len(matrix[0])
x,y = 0,0
up,down,left,right = 0,M-1,0,N-1
plus = [(0,1),(1,0),(0,-1),(-1,0)]
point = 0
res = []
while len(res) < M*N:
res.append(matrix[x][y])
if point == 0 and y == right:
up += 1
point += 1
elif point == 1 and x == down:
right -= 1
point +=1
elif point == 2 and y == left:
down -= 1
point += 1
elif point == 3 and x == up:
left += 1
point += 1
point = point%4
x += plus[point][0]
y += plus[point][1]
return res