python----螺旋矩阵

源代码：https://blog.csdn.net/qq_26392583/article/details/61435200

n = int(input('自定义行列数（行列相同）：\t\t\t'))
#初始化数组
arr = [[0]*n for i in range(n)]
#递归解决
def dfs(arr, x, y, start, n):
    if n<=0:return 0
    if n==1:
        arr[x][y] = start
        return 0
    #up
    for i in range(n):
        arr[x][y+i] = start
        start += 1
    #right
    for i in range(n-1):
        arr[x+1+i][y+n-1] = start
        start += 1
    #down
    for i in range(n-1):
        arr[x+n-1][y+n-2-i] = start
        start += 1
    #left
    for i in range(n-2):
        arr[x+n-2-i][y] = start
        start += 1
    dfs(arr,x+1,y+1,start,n-2)

a = dfs(arr,0,0,1,n)
#格式化输出print
l = len(str(n*n))+1
format = ('%'+str(l)+'d')*n
for tmp in arr:
    print(format%tuple(tmp))

源代码：http://www.jb51.net/article/87809.htm    修改后版本

import itertools

n = int(input("请自定义矩阵列数：\t\t\t"))
m = int(input("请自定义矩阵行数：\t\t\t"))
def spiral(n, m):
    _status = itertools.cycle(['right', 'down', 'left', 'up'])  # 用于状态周期性的切换
    _movemap = {
        'right': (1, 0),
        'down': (0, 1),
        'left': (-1, 0),
        'up': (0, -1),
    }
    pos2no = dict.fromkeys([(x, y) for x in range(n) for y in range(m)])
    _pos = (0, 0)
    _st = next(_status)
    for i in range(1, n * m + 1):
        _oldpos = _pos
        _pos = tuple(map(sum, zip(_pos, _movemap[_st])))  # 根据状态进行移动
        if (_pos not in pos2no) or (pos2no[_pos]):  # 当超出范围或遇到障碍时切换方向
            _st = next(_status)
            _pos = tuple(map(sum, zip(_oldpos, _movemap[_st])))
        pos2no[_oldpos] = i
    return pos2no

def display_spiral(n, m):
    pos2no = spiral(n, m)
    for i in range(m):
        for j in range(n):
            print( pos2no[(j, i)], end='\t\t')
        print('\n')

display_spiral(n, m)