class Solution {
private void reverse(int[] arr) {
int l = 0, r = arr.length - 1, tmp = 0;
while (l < r) {
tmp = arr[l];
arr[l] = arr[r];
arr[r] = tmp;
l++;
r--;
}
}
public void rotate(int[][] matrix) {
int m = matrix.length, n = matrix[0].length;
int tmp = 0;
for (int x = 0; x < m; x++) {
for (int y = 0; y < x; y++) {
tmp = matrix[x][y];
matrix[x][y] = matrix[y][x];
matrix[y][x] = tmp;
}
}
for (int[] row : matrix) {
reverse(row);
}
}
}
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交