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] ]
题目链接:https://leetcode.com/problems/rotate-image/
题目分析:
len = 4
(0,2) <- (1,0) (0,1) <- (2,0) (0,0) <- (3,0)
(1,0) <- (3,1) (2,1) <- (3,2) (3,0) <- (3,3)
(3,1) <- (2,3) (3,2) <- (1,3) (3,3) <- (0,3)
(2,3) <- (0,2) (1,3) <- (0,1) (0,3) <- (0,0)
(1,1) <- (2,1) (1,2) <- (1,1)
(2,2) <- (1,2) (2,1) <- (2,2)
(x,y) -> (len - y - 1,x)
1ms,时间击败100%
class Solution {
public void rotate(int[][] matrix) {
int len = matrix.length;
for (int x = 0; x < len >> 1; x++) {
for (int y = x; y < len - x - 1; y++) {
int tmp = matrix[x][y];
matrix[x][y] = matrix[len - y - 1][x];
matrix[len - y - 1][x] = matrix[len - x - 1][len - y - 1];
matrix[len - x - 1][len - y - 1] = matrix[y][len - x - 1];
matrix[y][len - x - 1] = tmp;
}
}
}
}