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] ]
需要注意的是要先定义一个temp数组存放刚开始的数据,防止数据被覆盖。而且内层的循环到最末端的前一个,因为当你循环到最末端时,最末端的数据已经是替换过后的数据了:
public void rotate(int[][] matrix) {
int n = matrix.length;
for(int num=0;num<n/2;num++)
{
//help(matrix,i,n);
int[] temp = new int[n-2*num];
for(int i=num;i<n-num-1;i++)
{
temp[i-num] = matrix[i][n-num-1];
matrix[i][n-num-1] = matrix[num][i];
matrix[num][i] = matrix[n-1-i][num];
matrix[n-1-i][num] = matrix[n-1-num][n-1-i];
matrix[n-1-num][n-1-i] = temp[i-num];
//break;
}
}
}