-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path54.py
50 lines (41 loc) · 1.22 KB
/
54.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
def spiralOrder(matrix: list[list[int]]) -> list[int]:
m, n = len(matrix), len(matrix[0])
ans = []
i, j = 0, 0
UP, DOWN, RIGHT, LEFT = 0, 1, 2, 3
direction = RIGHT
UP_WALL = 0
RIGHT_WALL = n
DOWN_WALL = m
LEFT_WALL = -1
while len(ans) != m*n:
if direction == RIGHT:
while j < RIGHT_WALL:
ans.append(matrix[i][j])
j += 1
i, j = i+1, j-1
RIGHT_WALL -= 1
direction = DOWN
elif direction == DOWN:
while i < DOWN_WALL:
ans.append(matrix[i][j])
i += 1
i, j = i-1, j-1
DOWN_WALL -= 1
direction = LEFT
elif direction == LEFT:
while j > LEFT_WALL:
ans.append(matrix[i][j])
j -= 1
i, j = i-1, j+1
LEFT_WALL += 1
direction = UP
else:
while i > UP_WALL:
ans.append(matrix[i][j])
i -= 1
i, j = i+1, j+1
UP_WALL += 1
direction = RIGHT
return ans
print(spiralOrder(matrix=[[1,2,3,4],[5,6,7,8],[9,10,11,12]]))