LeetCode 59. Spiral Matrix II(Python)

题目描述:
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]

思路:
螺旋式绕圈赋值即可,停止条件即当所有均赋值完。

AC代码:

    def generateMatrix(self, n):
        """
        :type n: int
        :rtype: List[List[int]]
        """
        if n == 0:
            return []
        res = [[0 for x in range(n)] for x in range(n)]
        cnt, choice = 1, 0
        i, j = 0, 0
        weight = 1
        res[0][0] = 1
        while cnt < n * n:
            if choice == 0:
                j += 1
                res[i][j] = cnt + 1
                if j == n - weight:
                    choice = 1
            elif choice == 1:
                i += 1
                res[i][j] = cnt + 1
                if i == n - weight:
                    choice = 2
            elif choice == 2:
                j -= 1
                res[i][j] = cnt + 1
                if j == weight - 1:
                    choice = 3
                    weight += 1
            elif choice == 3:
                i -= 1
                res[i][j] = cnt + 1
                if i == weight - 1:
                    choice = 0
            cnt += 1
        return res
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值