螺旋填数问题

最新推荐文章于 2024-01-05 22:24:20 发布

lies@

最新推荐文章于 2024-01-05 22:24:20 发布

阅读量570

点赞数 2

分类专栏： python 文章标签： python

本文链接：https://blog.csdn.net/ironman321/article/details/104159806

版权

python 专栏收录该内容

0 篇文章 0 订阅

订阅专栏

螺旋填数问题[python实现]

heng = int(input('请输入行数:'))
zong = int(input('请输入列数:'))
he = heng * zong
b = [[0 for k in range(zong)]for k in range(heng)]   #横纵都为0
quan = 1
if heng > zong:
    xy = (zong-1)//2+1
else:
    xy = (heng - 1) // 2 + 1
for cc in range(xy):
    for i in range(quan-1, zong - quan + 1):
        if b[quan - 1][i - 1] + 1 > he:
            break
        else:
            b[quan - 1][i] = b[quan - 1][i - 1] + 1
    for i in range(quan, heng - (quan - 1)):
        if b[i - 1][zong - quan] + 1 > he:
            break
        else:
            b[i][zong - quan] = b[i - 1][zong - quan] + 1
    for i in range(zong - quan - 1, quan - 1 - 1, -1):
        if b[heng - quan][i + 1] + 1 > he:
            break
        else:
            b[heng - quan][i] = b[heng - quan][i + 1] + 1
    for i in range(heng - quan - 1, quan - 1, -1):#5-1
        if b[i + 1][quan - 1] + 1 > he:
            break
        else:
            b[i][quan - 1] = b[i + 1][quan - 1] + 1
    quan += 1

kk = 0
for k in b:
    for kkk in k:
        print(kkk, end='\t')
        kk += 1
        if kk == zong:
            print()
            kk = 0