https://oj.leetcode.com/problems/rotate-image/
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?
public void rotate(int[][] matrix)
问题分析:这一题的难点在于它很烦,而且也需要仔细小心。我这里采取的做法是由外向内旋转,也就是最外层先转,然后一层一层往里转。但这个顺序并没有太大关系,这种一层层的关系只是让我们明白这题有N / 2层就好。譬如一个4 * 4的方阵其实从外到内只有两层。大家画一画就知道了。然后每一层的旋转,都是四个角的旋转。下方的元素到左方,左方的元素到上方,上方的元素到右方,右方的元素到下方。基于这四点来进行位置的判断就好。给出代码如下:
public void rotate(int[][] matrix) {
for(int i = 0; i < matrix.length / 2; i++){
for(int j = i; j < matrix.length - i - 1; j++){
int tmp = matrix[i][j];
matrix[i][j] = matrix[matrix.length - 1 - j][i];
matrix[matrix.length - 1 - j][i] = matrix[matrix.length - i - 1][matrix.length - 1 - j];
matrix[matrix.length - 1 - i][matrix.length - 1 - j] = matrix[j][matrix.length - 1 - i];
matrix[j][matrix.length - 1 - i] = tmp;
}
}
}