找规律
public class Solution {
public void rotate(int[][] matrix) {
int n = matrix.length;
int res[][]=new int[n+1][n+1];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
res[i][j] = matrix[i][j];
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
matrix[i][j]=res[n-1-j][i];
}
}
}
}