思路：先按水平中線翻轉(zhuǎn)，再按主對(duì)角線翻轉(zhuǎn)

def rotate(matrix):m, n = len(matrix), len(matrix[0])dp = [[0] * m for _ in range(n)] # matrix = m*n, dp = n*m# 先按水平中線翻轉(zhuǎn)for i in range(m//2):for j in range(n):temp = matrix[i][j]matrix[i][j] = matrix[m-1-i][j]matrix[m-1-i][j] = temp# 再按主對(duì)角線翻轉(zhuǎn)min_ = min(m, n)for i in range(min_):for j in range(i+1):temp = matrix[i][j]dp[i][j] = matrix[j][i]dp[j][i] = temp# 若原始矩陣：行 > 列，補(bǔ)dp的最后一列if m > n:for i in range(n):dp[i][m-1] = matrix[m-1][i]# 若原始矩陣：行 < 列，補(bǔ)dp的最后一行elif m < n:for i in range(m):dp[n-1][i] = matrix[i][n-1]return dpr3 = rotate([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) print(r3)r1 = rotate([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]) print(r1)r2 = rotate([[1, 2, 3, 4], [5, 6, 7, 8],[9, 10, 11, 12]]) print(r2)

?

總結(jié)

以上是生活随笔為你收集整理的编程题：顺时针打印矩阵（不一定是方阵）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。