leet48：旋转图像

public static void rotate(int[][] matrix) {

    int n = matrix.length;
    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
    System.out.println("--------------------");

    // transpose matrix
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            int tmp = matrix[j][i];
            matrix[j][i] = matrix[i][j];
            matrix[i][j] = tmp;
        }
    }
    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
    // reverse each row
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n / 2; j++) {
            int tmp = matrix[i][j];
            matrix[i][j] = matrix[i][n - j - 1];
            matrix[i][n - j - 1] = tmp;
        }
    }
    System.out.println("--------------------");
    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
}
/*
1 2 3 
4 5 6 
7 8 9 
--------------------
1 4 7 
2 5 8 
3 6 9 
--------------------
7 4 1 
8 5 2 
9 6 3 
* */

public static void rotate(int[][] matrix) {
    int n = matrix.length;

    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
    System.out.println("---------------------------");
    // 上下翻转，两种写法
    // 第一种
    //  for (int i =0; i < n /2 ; i++ ){
    //      for (int j =0; j < n; j ++){
    //          int tmp = matrix[i][j];
    //          matrix[i][j] = matrix[n-i-1][j];
    //          matrix[n-i-1][j] = tmp;
    //      }
    //  }
    // 第二种
    for (int i = 0; i < n / 2; i ++){
        int[] tmp = matrix[i];
        matrix[i] = matrix[n - i - 1];
        matrix[n - i - 1] = tmp;
    }
    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
    //System.out.println(Arrays.deepToString(matrix));
    // 对角翻转
    for (int i = 0; i < n; i ++){
        for (int j= i + 1; j < n; j++){
            int tmp = matrix[i][j];
            matrix[i][j] = matrix[j][i];
            matrix[j][i] = tmp;
        }
    }
    System.out.println("---------------------------");
    for (int i = 0; i <n ; i++) {
        for (int j = 0; j <n ; j++) {
            System.out.print(matrix[i][j]+" ");
        }
        System.out.println();
    }
}

旋转四个矩形

public static void rotate2(int[][] matrix) {
    int n = matrix.length;
    for (int i = 0; i < n / 2 + n % 2; i++) {
        for (int j = 0; j < n / 2; j++) {
            int[] tmp = new int[4];
            int row = i;
            int col = j;
            for (int k = 0; k < 4; k++) {
                tmp[k] = matrix[row][col];
                int x = row;
                row = col;
                col = n - 1 - x;
            }
            for (int k = 0; k < 4; k++) {
                matrix[row][col] = tmp[(k + 3) % 4];
                int x = row;
                row = col;
                col = n - 1 - x;
            }
        }
    }
}

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