leetcode-SpiralMatrixII螺旋矩阵2之python大法好,四行就搞定,你敢信?

王朝学院·作者佚名  2016-08-27
窄屏简体版  字體: 小  |  中  |  大  |  超大  

Spiral Matrix II

螺旋矩阵

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 ]

]

看博客园有人面试碰到过这个问题,长篇大论看得我头晕。跑去leetcode讨论区,看来看去还是我python大法牛逼,四行就搞定了你敢信。。

| 1 | 2 | 3 |

| 8 | 9| 4 |

| 7 6 | 5 |

如果看不明白的话,大致过程像上面这样,颜色相同表示在同一步骤里面执行

>>> def generateMatrix(n):

... A, low = [], n*n+1

... while low > 1:

... low, high = low - len(A), low

... A = [list(range(low, high))] + list(zip(*A[::-1])) # python3.3 语法 与2.7会有差别

...PRint(A)

... return A

...

>>> generateMatrix(1)

[[]]

[[1]]

[[1]]

>>> generateMatrix(2)

[[]]

[[4]]

[[3],

(4,)]

[[1, 2],

(4, 3)]

[[1, 2], (4, 3)]

>>> generateMatrix(3)

[[]]

[[9]]

[[8],

(9,)]

[[6, 7],

(9, 8)]

[[4, 5],

(9, 6),

(8, 7)]

[[1, 2, 3],

(8, 9, 4),

(7, 6, 5)]

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

 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
© 2005- 王朝網路 版權所有 導航