编程题：顺时针打印矩阵（不一定是方阵）

思路：先按水平中线翻转，再按主对角线翻转

def rotate(matrix):
    m, n = len(matrix), len(matrix[0])


    dp = [[0] * m for _ in range(n)]    # matrix = m*n, dp = n*m

    # 先按水平中线翻转
    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

    # 再按主对角线翻转
    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

    # 若原始矩阵：行 > 列，补dp的最后一列
    if m > n:
        for i in range(n):
            dp[i][m-1] = matrix[m-1][i]

    # 若原始矩阵：行 < 列，补dp的最后一行
    elif m < n:
        for i in range(m):
            dp[n-1][i] = matrix[i][n-1]


    return dp


r3 = 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)