You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Follow up:
Could you do this in-place?
Answer 1:
Not difficult. With 15 mins I finished the following solution and get accepted.
<code>
public class Solution {
public void rotate(int[][] matrix) {
if (matrix.length == 0 | matrix.length == 1) {
return ;
}
int n = matrix.length;
int[][] result = new int[n][n];
for (int i = 0; i < n; i ++) {
for (int j = 0; j < n; j++) {
result[i][j] = matrix[n - 1 - j][i];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
matrix[i][j] = result[i][j];
}
}
}
}
</code>
Follow up需要的Solution也不难,看看15分钟够不够:
<code>
public class Solution {
public void rotate(int[][] matrix) {
if (matrix.length == 0 | matrix.length == 1) {
return ;
}
int n = matrix.length;
for (int i = 0; i < (n + 1) / 2; i++) {
for (int j = 0; j < n / 2; j++) {
int newVal = matrix[j][n - 1 - i];
int oldVal = matrix[i][j];
matrix[j][n - 1 - i] = oldVal;
oldVal = newVal;
newVal = matrix[n - 1 - i][n - 1 - j];
matrix[n - 1 - i][n - 1 - j] = oldVal;
oldVal = newVal;
newVal = matrix[n - 1 - j][i];
matrix[n - 1 - j][i] = oldVal;
matrix[i][j] = newVal;
}
}
}
}
</code>