算法优化：python转置方阵的打印

Python 方阵转置及算法优化

最新推荐文章于 2022-04-09 17:44:17 发布

Monkey_24

最新推荐文章于 2022-04-09 17:44:17 发布

阅读量326

点赞数

CC 4.0 BY-SA版权

分类专栏： python Python学习记录文章标签：方阵 python python3 算法优化

本文链接：https://blog.youkuaiyun.com/u012335228/article/details/90446201

python 同时被 2 个专栏收录

99 篇文章

订阅专栏

Python学习记录

71 篇文章

订阅专栏

博客主要围绕方阵转置展开，涉及 Python 语言实现，还包含运行结果展示以及案例变形。重点在于利用 Python 进行方阵转置操作，并可能涉及相关算法优化。

转置方阵：

n = 9
lst1 = []
lst2 = list(range(1,n+1))

width = int(n**0.5)
for i in range(0,len(lst2),width):
    lst1.append(lst2[i:i+width])
else:
    print(lst1)
    for i in range(width):
        print(lst1[i])
    
for x in range(len(lst1)):
    if x == x * (width+1):
        continue
    else:
        for j in range(x):
            lst1[x][j],lst1[j][x] = lst1[j][x],lst1[x][j]
else:
    print('------------------------')
    print(lst1)
    for i in range(width):
        print(lst1[i])

运行结果：

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

案例变形：

n = 9
lst1 = []
lst2 = list(range(1,n+1))

width = int(n**0.5)
for i in range(0,len(lst2),width):
    lst1.append(lst2[i:i+width])
else:
    print(lst1)
    for i in range(width):
        print(lst1[i])
    
for x,row1 in enumerate(lst1):
    for y,row2 in enumerate(row1):
        if x < y:
            lst1[x][y],lst1[y][x] = lst1[y][x],lst1[x][y]
else:
    print('----------------------------------')
    print(lst1)
    for i in range(width):
        print(lst1[i])

运行结果:

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