forked from algorhythms/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
053 Spiral Matrix.py
59 lines (49 loc) · 1.53 KB
/
053 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].
"""
__author__ = 'Danyang'
class Solution:
def spiralOrder(self, matrix):
"""
top
|
left --+-- right
|
bottom
be careful with the index
:param matrix: a list of lists of integers
:return: a list of integers
"""
if not matrix or not matrix[0]:
return matrix
result = []
left = 0
right = len(matrix[0])-1
top = 0
bottom = len(matrix)-1
while left<=right and top<=bottom:
for i in xrange(left, right+1):
result.append(matrix[top][i])
for i in xrange(top+1, bottom+1):
result.append(matrix[i][right])
for i in reversed(xrange(left+1, right)):
if top<bottom: # avoid double scanning the first row
result.append(matrix[bottom][i])
for i in reversed(xrange(top+1, bottom+1)):
if left<right: # avoid double scanning the first column
result.append(matrix[i][left])
left += 1
right -= 1
top += 1
bottom -= 1
return result
if __name__=="__main__":
print Solution().spiralOrder([[2, 3]])