2022.03.17 - NC069.BM99 顺时针旋转矩阵

1. 题目

2. 思路

(1) 模拟法

• 首先按照反对角线翻转数组，再按照水平对称翻转数组即可。

3. 代码

public class Test {
    public static void main(String[] args) {
    }
}

class Solution {
    public int[][] rotateMatrix(int[][] mat, int n) {
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                int temp = mat[i][j];
                mat[i][j] = mat[j][i];
                mat[j][i] = temp;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n >> 1; j++) {
                int temp = mat[i][j];
                mat[i][j] = mat[i][n - j - 1];
                mat[i][n - j - 1] = temp;
            }
        }
        return mat;
    }
}