55 lines
1.9 KiB
Java
55 lines
1.9 KiB
Java
|
package matrix;
|
|||
|
|
/**
|
|||
|
|
* 题目：48. 旋转图像 (setZeroes)
|
|||
|
|
* 描述：给定一个 n × n 的二维矩阵 matrix 表示一个图像。请你将图像顺时针旋转 90 度。
|
|||
|
|
* 你必须在 原地 旋转图像，这意味着你需要直接修改输入的二维矩阵。请不要 使用另一个矩阵来旋转图像。
|
|||
|
|
|
|||
|
|
* 链接：https://leetcode.cn/problems/rotate-image/description/
|
|||
|
|
*
|
|||
|
|
示例 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]]
|
|||
|
|
*/
|
|||
|
|
//不会原地旋转，只会借助辅助数组
|
|||
|
|
public class RotateImage {
|
|||
|
|
public void rotate(int[][] matrix) {
|
|||
|
|
int n = matrix.length;
|
|||
|
|
int[][] matrix_new = new int[n][n];
|
|||
|
|
for (int i = 0; i < n; ++i) {
|
|||
|
|
for (int j = 0; j < n; ++j) {
|
|||
|
|
matrix_new[j][n - i - 1] = matrix[i][j];
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
for (int i = 0; i < n; ++i) {
|
|||
|
|
for (int j = 0; j < n; ++j) {
|
|||
|
|
matrix[i][j] = matrix_new[i][j];
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
//原地旋转， (i,j)->(j,n-i-1) == 先翻转(j,i)->再交换左右列(j,n-i-1)
|
|||
|
|
public void rotate1(int[][] matrix) {
|
|||
|
|
int n = matrix.length;
|
|||
|
|
// 1. 转置矩阵：行列互换
|
|||
|
|
for (int i = 0; i < n; i++) {
|
|||
|
|
// j 从 i+1 开始，避免重复交换
|
|||
|
|
for (int j = i + 1; j < n; j++) {
|
|||
|
|
int temp = matrix[i][j];
|
|||
|
|
matrix[i][j] = matrix[j][i];
|
|||
|
|
matrix[j][i] = temp;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
// 2. 翻转每一行：相当于水平翻转
|
|||
|
|
for (int i = 0; i < n; i++) {
|
|||
|
|
for (int j = 0; j < n / 2; j++) {
|
|||
|
|
int temp = matrix[i][j];
|
|||
|
|
matrix[i][j] = matrix[i][n - 1 - j];
|
|||
|
|
matrix[i][n - 1 - j] = temp;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|