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?
[code]
public class Solution {
public void rotate(int[][] matrix) {
if(matrix ==null || matrix.length==0 )return;
int n=matrix.length;
int rs=0, re=n-1, cs=0, ce=n-1;
while(rs<re)
{
int len=re-rs+1;
int[] temp= new int[len];
int k=0, l=re;
while(k<len)temp[k++]=matrix[l--][cs];
int i=rs, j=cs;
while(i<=re)matrix[i++][cs]=matrix[re][j++];
i=cs;j=re;
while(i<=ce)matrix[re][i++]=matrix[j--][ce];
i=re;j=ce;
while(i>=rs)matrix[i--][ce]=matrix[rs][j--];
i=cs;j=0;
while(i<=ce)matrix[rs][i++]=temp[j++];
rs++;re--;
cs++;ce--;
}
}
}
[Thoughts]
in-place copy注意方向,比如下面的方法,左下角元素会被覆盖
int i=re, j=ce;
while(i>=rs)matrix[i--][cs]=matrix[re][j--];