1
class Solution {
2
public void swap(int[][] matrix, int n1, int m1, int n2, int m2) {
3
int a = matrix[n1][m1];
4
int temp = matrix[n2][m2];
5
matrix[n2][m2] = a;
6
matrix[n1][m1] = temp;
7
}
8

9
public void rotate(int[][] matrix) {
10
int n = matrix.length;
11
for (int i = 0; i < n / 2; i++) {
12
for (int j = 0; j < n; j++) {
13
swap(matrix, i, j, n - i - 1, j);
14
}
15
}
16
for (int i = n - 1; i >= 0; i--) {
17
for (int j = 0; j < i; j++) {
18
swap(matrix, i, j, j, i);
19
}
20
}
21
}
22
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0