Leetcode 螺旋数组Ⅱ

题目描述

给定一个正整数 n，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的正方形矩阵。

示例:

输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]

分析：
从左到右、从上到下、从右到左、从下到上赋值矩阵

思路解析

class Solution:
      def generateMatrix(self, n: int) -> [[int]]:
        left, right, top, bottom = 0, n - 1, 0, n - 1
        matrix = [[0 for _ in range(n)] for _ in range(n)]
        num, tar = 1, n * n
        while num <= tar:
            for i in range(left, right + 1): # left to right
                matrix[top][i] = num
                num += 1
            top += 1
            for i in range(top, bottom + 1): # top to bottom
                matrix[i][right] = num
                num += 1
            right -= 1
            for i in range(right, left - 1, -1): # right to left
                matrix[bottom][i] = num
                num += 1
            bottom -= 1
            for i in range(bottom, top - 1, -1): # bottom to top
                matrix[i][left] = num
                num += 1
            left += 1
        return matrix