Leetcode48. 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]
]
思路一
找出这几个数索引之间的关系(规律):任意一个(i,j)
, (j, n-i-1)
, (n-i-1, n-j-1)
, (n-j-1, i)
就是这四个索引号上的数交换。
思路二
先转置,然后把每列对称交换一下。
Python
class Solution:
def rotate(self, matrix: List[List[int]]) -> None:
"""
Do not return anything, modify matrix in-place instead.
"""
n = len(matrix)
for i in range(n//2):
for j in range(i, n - i - 1):
matrix[i][j],matrix[j][n-i-1],matrix[n-i-1][n-j-1],matrix[n-j-1][i] = \
matrix[n-j-1][i], matrix[i][j],matrix[j][n-i-1],matrix[n-i-1][n-j-1]
Java
public void rotate(int[][] matrix) {
//以对角线为轴交换
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j <= i; j++) {
if (i == j) {
continue;
}
int temp = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = temp;
}
}
//交换列
for (int i = 0, j = matrix.length - 1; i < matrix.length / 2; i++, j--) {
for (int k = 0; k < matrix.length; k++) {
int temp = matrix[k][i];
matrix[k][i] = matrix[k][j];
matrix[k][j] = temp;
}
}
}
C++
void rotate(vector<vector<int>>& m) {
int n = m.size();
for(int i=0; i<n; i++)
for(int j=0; j<i; j++)
swap(m[i][j], m[j][i]);
for(int i=0; i<n; i++)
reverse(m[i].begin(), m[i].end()); //反转每行
}