leetcode 日经贴，python code -Spiral Matrix

Spiral Matrix

class Solution:
    # @param matrix, a list of lists of integers
    # @return a list of integers
    def spiralOrder(self, matrix):
        n = len(matrix)
        if n == 0: return []
        m = len(matrix[0])
        lst = range(n * m)
        indx = 0
        for i in range((n + 1) / 2):
            st, edi, edj = i, n - 1 - i, m - 1 - i
            if st > edi or st > edj: break
            if st == edi:
                for j in range(st, edj + 1):
                    lst[indx] = matrix[st][j]
                    indx += 1
            elif st == edj:
                for j in range(st, edi + 1):
                    lst[indx] = matrix[j][st]
                    indx += 1
            else:
                for j in range(st, edj):
                    lst[indx] = matrix[st][j]
                    indx += 1
                for j in range(st, edi):
                    lst[indx] = matrix[j][edj]
                    indx += 1
                for j in range(edj, st, -1):
                    lst[indx] = matrix[edi][j]
                    indx += 1
                for j in range(edi, st, -1):
                    lst[indx] = matrix[j][st]
                    indx += 1
        return lst

因为边界条件 没考虑清楚，错了两次

if st > edi or st > edj: break

最后

以上就是温柔路人最近收集整理的关于leetcode 日经贴，python code -Spiral Matrix的全部内容，更多相关leetcode内容请搜索靠谱客的其他文章。