螺旋矩阵 - 熟练运用列表的特性

#如果说前面那个含有正方形矩阵的特殊性,那么这个代码就适用于任何形状的矩阵
def lbdj(a,b):  
#这是一个两个列表互相插入式的函数
    d = []
    for i in range(0,len(a)):
        d.append(a[i])
        d.append(b[i])
    return d
def helix_matrix(k, l):
    """
    k x l 阶的螺旋矩阵函数
    :param k: k列
    :param l: l行
    :return:  返回一个 k x l 阶的螺旋矩阵列表
    """
    
    list1 = [[0] * k for _ in range(l)]
    x = 0
    y = 0
    num = 1
    n = 0
    list3 = [x1 for x1 in range(k, 0, -1)]
    list4 = [y1 for y1 in range(l - 1, l - k - 1,-1)]
    list2 = lbdj(list3, list4)
    while 1:
        for _ in range(list2[n]):
            list1[x][y] = num
            num += 1
            y += 1
        y -= 1
        n += 1
        x += 1
        if n == len(list2):
            return list1
        for _ in range(list2[n]):
            list1[x][y] = num
            num += 1
            x += 1
        x -= 1
        n += 1
        y -= 1
        if n == len(list2):
            return list1
        for _ in range(list2[n]):
            list1[x][y] = num
            num += 1
            y -= 1
        y += 1
        n += 1
        x -= 1
        if n == len(list2):
            return list1
        for _ in range(list2[n]):
            list1[x][y] = num
            num += 1
            x -= 1
        x += 1
        n += 1
        y += 1
        if n == len(list2):
            return list1


def main():
    print(helix_matrix(5, 7))


if __name__ == '__main__':
    main()

输出结果如下:

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