一个求 回形矩阵算法的 python实现，请指正

[albertlee]

def Circle(begin , size,layer , dat,C):
left = range ( begin,begin + size )
bottom = range(begin + size - 1 , begin + size * 2 - 1)
right = range( begin + size * 2 - 2 , begin + size * 3 -2)
top = range (begin + size * 3 -3 , begin + size * 4 - 3)
top[size - 1] = begin

for i in range(size):
dat[i + layer][layer] = left[i]
dat[C - layer - 1][layer + i] = bottom[i]
dat[layer + i][C - layer -1] = right[size - i - 1]
dat[layer][C - layer - i - 1] = top[i]

return dat

def Matrix(n):
C = n
dat = []
for i in range(n):
dat.append(range(n))

begin = 1
layer = 0
while n > 0:
dat = Circle(begin , n , layer , dat,C)
begin = begin + (4 * n - 4)
n = n - 2
layer = layer + 1

return dat

if __name__ == "__main__":
for n in range(7):
dat = Matrix(n)
for i in range(n):
print dat[i]

>>>>
[1]

[1, 4]
[2, 3]

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

[1, 12, 11, 10]
[2, 13, 16, 9]
[3, 14, 15, 8]
[4, 5, 6, 7]

[1, 16, 15, 14, 13]
[2, 17, 24, 23, 12]
[3, 18, 25, 22, 11]
[4, 19, 20, 21, 10]
[5, 6, 7, 8, 9]

[1, 20, 19, 18, 17, 16]
[2, 21, 32, 31, 30, 15]
[3, 22, 33, 36, 29, 14]
[4, 23, 34, 35, 28, 13]
[5, 24, 25, 26, 27, 12]
[6, 7, 8, 9, 10, 11]

[Perrin]

先顶下~

[mahongxi]

把空格转成[SP]吧，CSDN破玩意。

[albertlee]

:)

半年前的帖子，终于有人回了，哈哈

[xyzxyz1111]

good