LeetCode--059--螺旋矩阵 II（python）

效率超级低，但是能过。。。。

class Solution:
    def generateMatrix(self, n):
        tR = tC = 0
        dR = n-1
        dC = n-1
        x = [[0 for i in range(n)] for j in range(n)]
        nowNum=1
        while(tR <= dR and tC <=dC):
            nowNum = self.draw(tR,tC,dR,dC,x,nowNum)
            tR+=1
            tC+=1
            dR-=1
            dC-=1
        return x
    def draw(self,tR,tC,dR,dC,lists,nowNum):
        i = tC
        j = tR
        flag = False
        while(i<=dC):#往右
            lists[tR][i]=nowNum
            #print("{} {} {}".format(tR,i,nowNum))
            nowNum+=1
            i+=1
        i-=1
        j+=1
        while(j<=dR):#往下
            lists[j][dC]=nowNum
#             print("{} {} {}".format(j,dC,nowNum))
            nowNum+=1
            j+=1
        j-=1
        i-=1
        if j == dR and dR != tR:
            while(i >= tC):#往左
                lists[dR][i]=nowNum
#                 print("{} {} {}".format(dR,i,nowNum))
                nowNum+=1
                flag = True
                i-=1
            i+=1
        
        if flag and i==tC:
            j-=1
            while(j >tR):#往上
                lists[j][tC]=nowNum
                #print("{} {} {}".format(j,tC,nowNum))
                nowNum+=1
                j-=1
            j+=1
        return nowNum