LeetCode48 旋转图像

class Solution {
    public void rotate(int[][] matrix) {
        int n=matrix.length;
        int [][]matrixF=new int[n][n];
        for(int i=0;i=0;j--)
            {
                matrixF[i][k++]=matrix[j][i];
            }
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                matrix[i][j] = matrixF[i][j];
            }
        }
    }


}

由于题解文字描述过于长，因此画了张图来帮助理解：

 

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for (int i = 0; i < n / 2; ++i) {
            for (int j = 0; j < (n + 1) / 2; ++j) {
                int temp = matrix[i][j];
                matrix[i][j] = matrix[n - j - 1][i];
                matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1];
                matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1];
                matrix[j][n - i - 1] = temp;
            }
        }
    }
}