forked from jiguang123/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path054 Spiral Matrix.py
59 lines (53 loc) · 1.62 KB
/
054 Spiral Matrix.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
51
52
53
54
55
56
57
58
59
'''
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
For example,
Given the following matrix:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
You should return [1,2,3,6,9,8,7,4,5].
'''
class Solution(object):
def spiralOrder(self, matrix):
"""
:type matrix: List[List[int]]
:rtype: List[int]
"""
if not matrix:
return []
left = top = 0
right = len(matrix[0]) - 1
bottom = len(matrix) - 1
result = []
while left < right and top < bottom:
for i in range(left, right):
result.append(matrix[top][i])
for i in range(top, bottom):
result.append(matrix[i][right])
for i in range(right, left, -1):
result.append(matrix[bottom][i])
for i in range(bottom, top, -1):
result.append(matrix[i][left])
left += 1
right -= 1
top += 1
bottom -= 1
if left == right and top == bottom:
result.append(matrix[top][left])
elif left == right:
for i in range(top, bottom + 1):
result.append(matrix[i][left])
elif top == bottom:
for i in range(left, right + 1):
result.append(matrix[top][i])
return result
if __name__ == "__main__":
assert Solution().spiralOrder([
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
]) == [1, 2, 3, 6, 9, 8, 7, 4, 5]
assert Solution().spiralOrder([[2], [3]]) == [2, 3]
assert Solution().spiralOrder([[2, 3]]) == [2, 3]