-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathSpiral-Matrix-II.py
63 lines (61 loc) · 1.74 KB
/
Spiral-Matrix-II.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
60
61
62
63
## python Solution 1:
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
res = [[0]* n for _ in range(n)] ##python初始化二维数组
out = [i for i in range(n*n,0,-1)]
u = 0
d = n-1
l = 0
r = n-1
while True: ## 可以改为while num<=pow(n,2): 更节省时间
for i in range(l,r+1,1):
res[u][i] = out[-1]
#del out[-1]
out.pop()
u+=1
if u>d:break
for i in range(u,d+1,1):
res[i][r] = out[-1]
del out[-1]
r-=1
if r<l:break
for i in range(r,l-1,-1):
res[d][i] = out[-1]
del out[-1]
d-=1
if d<u:break
for i in range(d,u-1,-1):
res[i][l]=out[-1]
del out[-1]
l+=1
if l>r:break
return res
## Python Solution 1 改进版:
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
res = [[0]* n for _ in range(n)] ##python初始化二维数组
# res = [[0 for _ in range(n)] for _ in range(n)]
u = 0
d = n-1
l = 0
r = n-1
m = pow(n,2)
num = 1
while num<=m:
for i in range(l,r+1,1):
res[u][i] = num
num+=1
u+=1
for i in range(u,d+1,1):
res[i][r] = num
num+=1
r-=1
for i in range(r,l-1,-1):
res[d][i] = num
num+=1
d-=1
for i in range(d,u-1,-1):
res[i][l]=num
num+=1
l+=1
return res