leetcode-hard-array-54. Spiral Matrix-NO

mycode

思路：这种方格图一定要预先设置定位的变量，例如最大的长、宽，变化中的长、宽，在while循环中也要不断判断是否满足break条件

class Solution(object):
    def spiralOrder(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: List[int]
        """
        m = len(matrix)
        if m ==  : return []   # []
        n = len(matrix[])
        if n ==  : return []  #[[],[]]
        m = m - ; n = n -
        r ,l =  ,
        res = []
        #当r == n的时候，也还是要循环
        while r <= n and l <= m:
            for i in range(r,n+):
                res.append(matrix[l][i])
            l = l +
            if l > m : break
            for i in range(l,m+):
                res.append(matrix[i][n])
            n = n - ; i = n
            if n < r : break
            while i >= r:
                res.append(matrix[m][i])
                i -=
            m = m - ; i = m
            if m < l : break
            while i >= l:
                res.append(matrix[i][r])
                i -=
            r +=
        return res