-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsprialMatrixII.py
37 lines (35 loc) · 960 Bytes
/
sprialMatrixII.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
# Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
#
# For example,
# Given n = 3,
# You should return the following matrix:
#
# [
# [ 1, 2, 3 ],
# [ 8, 9, 4 ],
# [ 7, 6, 5 ]
# ]
class Solution(object):
def generateMatrix(self, n):
"""
:type matrix: List[List[int]]
:rtype: List[int]
"""
dir = [(0,1), (1, 0), (0, -1), (-1, 0)]
d = 0
i, j = 0, 0
matrix = [[0] * n for _ in range(n)]
visited = [[0] * n for _ in range(n)]
steps = 0
while steps < n * n:
visited[i][j] = 1
matrix[i][j] = steps + 1
a = i + dir[d][0]
b = j + dir[d][1]
if a < 0 or a > n-1 or b < 0 or b > n-1 or visited[a][b]:
d = (d+1) % 4
a = i + dir[d][0]
b = j + dir[d][1]
i, j = a, b
steps += 1
return matrix