题解 | #顺时针旋转矩阵#
顺时针旋转矩阵
https://www.nowcoder.com/practice/2e95333fbdd4451395066957e24909cc
import java.util.*; public class Solution { public int[][] rotateMatrix(int[][] mat, int n) { // write code here int[][] ints = new int[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ints[i][j] = mat[n-1-j][i]; } } return ints; } }