【重点】【矩阵】48.旋转图像

题目

法1：基础好法

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        int[][] newMatrix = new int[n][];
        for (int i = 0;i < n; ++i) {
            newMatrix[i] = matrix[i].clone();
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                matrix[j][n - 1 - i] = newMatrix[i][j];
            }
        }
    }
}

法2

参考：https://leetcode.cn/problems/rotate-image/solutions/1228078/48-xuan-zhuan-tu-xiang-fu-zhu-ju-zhen-yu-jobi/?envType=study-plan-v2&envId=top-100-liked

代码007普通

打赏 收藏 海报 链接