题解 | #顺时针旋转矩阵#

import java.util.*;

public class Solution {
    public int[][] rotateMatrix(int[][] mat, int n) {
        // write code here
        int[][] ans = new int[n][n];
        // 找规律题
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++){
                ans[i][j] = mat[n - j - 1][i];
            }
        }
        return ans;
    }
}