1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
| class Solution { public void rotate(int[][] matrix) {
int n = matrix.length; for (int i = 0; i < n / 2; i++) { for (int j = 0; j < n; j++) { int tmp = matrix[i][j]; matrix[i][j] = matrix[n - i - 1][j]; matrix[n - i - 1][j] = tmp; } }
for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i <= j) { break; }
int tmp = matrix[i][j]; matrix[i][j] = matrix[j][i]; matrix[j][i] = tmp; } } } }
|
References
48. Rotate Image
面试题 01.07. 旋转矩阵