面试题 01.07. 旋转矩阵

面试题 01.07. 旋转矩阵

给你一幅由 N × N 矩阵表示的图像，其中每个像素的大小为 4 字节。请你设计一种算法，将图像旋转 90 度。

不占用额外内存空间能否做到？

 

示例 1:

给定 matrix = 
[
  [1,2,3],
  [4,5,6],
  [7,8,9]
],

原地旋转输入矩阵，使其变为:
[
  [7,4,1],
  [8,5,2],
  [9,6,3]
]
示例 2:

给定 matrix =
[
  [ 5, 1, 9,11],
  [ 2, 4, 8,10],
  [13, 3, 6, 7],
  [15,14,12,16]
], 

原地旋转输入矩阵，使其变为:
[
  [15,13, 2, 5],
  [14, 3, 4, 1],
  [12, 6, 8, 9],
  [16, 7,10,11]
]

方法1：额外空间

public void rotate(int[][] matrix) {
    int N = matrix.length;
    int[][] res = new int[N][N];
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            res[j][N - 1 - i] = matrix[i][j];
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            matrix[i][j] = res[i][j];
        }
    }
}

方法2：原地

public void rotate(int[][] matrix) {
            int N = matrix.length;
            //先按对角线翻转
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < i; j++) {
                    int t = matrix[j][i];
                    matrix[j][i] = matrix[i][j];
                    matrix[i][j] = t;
                }
            }
            int m = N >> 1;
            //再按中间列翻转
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < m; j++) {
                    int t = matrix[i][j];
                    matrix[i][j] = matrix[i][N - 1 - j];
                    matrix[i][N - 1 - j] = t;
                }
            }
        }