48. Rotate Image
You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Note:
You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
Example 1:
Given input matrix =
[
[1,2,3],
[4,5,6],
[7,8,9]
],
rotate the input matrix in-place such that it becomes:
[
[7,4,1],
[8,5,2],
[9,6,3]
]
Example 2:
Given input matrix =
[
[ 5, 1, 9,11],
[ 2, 4, 8,10],
[13, 3, 6, 7],
[15,14,12,16]
],
rotate the input matrix in-place such that it becomes:
[
[15,13, 2, 5],
[14, 3, 4, 1],
[12, 6, 8, 9],
[16, 7,10,11]
]
emm这一题确实不算很难,他就是很简单的旋转变换。。。
说起这种变换,我们第一个肯定想到的是矩阵的转置,当然这个结果很明显不是,不过我们可以尝试先转置矩阵再观察
例如
[ [1,2,3],
[4,5,6],
[7,8,9] ],
这个矩阵,转置后就是
[ [1,4,7],
[2,5,8],
[3,6,9] ],
我们可以观察到跟答案的要求就是第一列和最后一列交换就行了。
对4 X 4的矩阵同样尝试,就发现答案就是矩阵的转置首尾互换,第二第三列互换
对N X N,很明显我们可以先把矩阵转置,然后首尾互换,第二列和倒数第二列互换...第i列和第n-i-1列互换。。
注意这是一个交换的过程,全部交换完,到第n/2列就可以了 不然会重复交换就相当于没换
这就是解决了这个问题了
下面是java代码,顺便吐个槽。。要是题目的python用的不是list[list[]]而是numpy就好了,我就直接用矩阵转置就行了,虽然嘛手动转置也不难
代码如下:
public void rotate(int [][]matrix){
int n = matrix.length;
int [][]answer = new int[n][n];
//转置矩阵
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
answer[i][j] = matrix[j][i];
}
}
//交换
int temp = 0;
for(int j = 0;j < n/2;j++){
for(int i = 0;i < n;i++){
temp = answer[i][j];
answer[i][j] = answer[i][n - 1 -j];
answer[i][n - 1 - j] = temp;
}
}
//把结果赋值给原来的矩阵
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
matrix[i][j] = answer[i][j];
}
}
}