我对Python有点新手,正在寻找一个函数,可以将任何n x n的二维列表转换为一维列表,并按顺时针方向排列。
例如:
当 n = 3 时
list = [[2, 3, 5],[ 8, 7, 1],[ 0, 4, 6]]
或者
list = [[2, 3, 5]
,[8, 7, 1]
,[0, 4, 6]]
将会变成
result = [2, 3, 5, 1, 6, 4, 0, 8, 7]
当n = 5时
list = [[2, 3, 5, 9, 10],[ 8, 7, 1, 11, 13],[ 0, 4, 6, 21, 22], [12, 19, 17, 18, 25], [14, 15, 16, 23, 24]]
或者
list = [[ 2, 3, 5, 9, 10]
,[ 8, 7, 1, 11, 13]
,[ 0, 4, 6, 21, 22]
,[ 12, 19, 17, 18, 25]
, [ 14, 15, 16, 23, 24]]
会变成
result = [2, 3, 5, 9, 10, 13, 22, 25, 24, 23, 16, 15, 14, 12, 0, 8, 7, 1, 11, 21, 18, 17, 19, 4, 6]
我如何才能高效地处理任何值为nxn的情况?