LeetCode 59. 螺旋矩阵 II
给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/spiral-matrix-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
result = []
for i in range(n):
temp = []
for j in range(n):
temp.append(0)
result.append(temp)
x1, y1, x2, y2 = 0, 0, n - 1, n - 1
count = 1
while x1 <= x2 and y1 <= y2:
for i in range(x1, x2 + 1):
result[y1][i] = count
count += 1
for j in range(y1 + 1, y2 + 1):
result[j][x2] = count
count += 1
if x1 < x2 and y1 < y2:
for i in range(x2 - 1, x1, - 1):
result[y2][i] = count
count += 1
for j in range(y2, y1, -1):
result[j][x1] = count
count += 1
x1 += 1
y1 += 1
x2 = x2 - 1
y2 = y2 - 1
return result