48. 旋转矩阵

class Solution:
    def rotate(self, matrix: List[List[int]]) -> None:
        """
        Do not return anything, modify matrix in-place instead.
        """
        # 一定是方形矩阵
        # 有点像   189.轮转数组
        # 找到规律，先上下对称翻转
        # 再沿主对角线翻转
        n = len(matrix)

        # 翻转的次数
        count =   math.floor(n/2)  

        # 上下对称翻转
        for i in range(count):
            for j in range(n):
                matrix[i][j], matrix[n-1 - i][j] = matrix[n-1 - i][j], matrix[i][j]
        
        # 沿对角线翻转
        for i in range(n):
            for j in range(i+1, n):
                matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]

        return matrix