面试题 01.07. 旋转矩阵

class Solution:
    def rotate(self, matrix: List[List[int]]) -> None:
        
        n = len(matrix)
        matrix_new = [[0] * n for _ in range(n)]

        #这里有一个公式：原矩阵[i][j] === 变换后[j][n-i-1]
        for i in range(n):
            for j in range(n):
                matrix_new[j][n-i-1] = matrix[i][j]
        matrix[:] = matrix_new
        return matrix