写个旋转矩阵吧~

def rot(a):
    n = len(a)
    if n <= 1:
        return a
    for i in range(n // 2):
        for j in range(i, n - i - 1):
            tmp = a[i][j]
            a[i][j] = a[n - 1 - j][i]
            a[n - 1 - j][i] = a[n - 1 - i][n - 1 - j]
            a[n - 1 - i][n - 1 - j] = a[j][n - 1 - i]
            a[j][n - 1 - i] = tmp


# 测试通过
for m in range(8):
    print("-"*10 + "--" + "-"*10)
    print("-"*10 + str(m) + "-"*10)
    print("-"*10 + "--" + "-"*10)
    if not m:
        a = []
    else:
        a = [[i + j for j in range(m)] for i in range(1, m ** 2 + 1, m)]

    for i in range(len(a)):
        print(a[i])

    print("-" * 20)
    rot(a)
    for i in range(len(a)):
        print(a[i])