leetcode题解记录-59螺旋矩阵 II（python3）

题目

59螺旋矩阵 II
题目链接
官方题解

代码记录

class Solution:
    def generateMatrix(self, n: int) -> List[List[int]]:
    	transfer={'right':'down','down':'left','left':'up','up':'right'}
    	policy={'right':(0,1),'down':(1,0),'left':(0,-1),'up':(-1,0)}
    	cnt=1
    	res=[[0 for i in range(n)] for j in range(n)]
    	cur_direction='right'
    	cur_pos=(0,0)
    	while cnt<=n*n:
    		res[cur_pos[0]][cur_pos[1]]=cnt
    		cnt+=1
    		next_pos=(cur_pos[0]+policy[cur_direction][0],cur_pos[1]+policy[cur_direction][1])
    		if any([next_pos[0]<0,next_pos[0]>n-1,next_pos[1]<0,next_pos[1]>n-1]) or res[next_pos[0]][next_pos[1]]!=0:
    			cur_direction=transfer[cur_direction]
    			cur_pos=(cur_pos[0]+policy[cur_direction][0],cur_pos[1]+policy[cur_direction][1])
    		else:
    			cur_pos=next_pos
    	return res