题目描述:
给你一幅由 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]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/rotate-matrix-lcci
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
我发现现在老是出这种矩阵的题,前些天碰到了矩阵乘法,矩阵转置,这个矩阵旋转,让我的内心…轻松许多,哈哈哈
矩阵旋转这个不过是先沿着辅对角线翻转,然后上下翻转
class Solution {
public void rotate(int[][] matrix) {
//沿着副对角线翻转
for(int i=0;i<matrix.length-1;i++)
{
for (int k=0;k<matrix.length-1-i;k++)
{
int temp=matrix[i][k];
matrix[i][k]=matrix[matrix.length-1-k][matrix.length-1-i];
matrix[matrix.length-1-k][matrix.length-1-i]=temp;
}
}
//上下翻转
for(int i=0;i<matrix.length/2;i++)
{
for (int k=0;k<matrix.length;k++) {
int temp = matrix[i][k];
matrix[i][k] = matrix[matrix.length - 1 - i][k];
matrix[matrix.length - 1 - i][k] = temp;
}
}
}
}
现在附上2个矩阵相乘的算法:
//2个矩阵相乘
Scanner scanner=new Scanner(System.in);
System.out.print("第一个矩阵的行:");
int rect1_row=scanner.nextInt();
System.out.print("第一个矩阵的列:");
int rect1_col=scanner.nextInt();
int[][] rect1=new int[rect1_row][rect1_col];
for(int i=0;i<rect1_row;i++)
{
for(int j=0;j<rect1_col;j++)
{
rect1[i][j]=scanner.nextInt();
}
}
System.out.print("第二个矩阵的行:");
int rect2_row=scanner.nextInt();
System.out.print("第二个矩阵的列:");
int rect2_col=scanner.nextInt();
int[][] rect2=new int[rect2_row][rect2_col];
int[][] result=new int[rect1_row][rect2_col];
for(int i=0;i<rect2_row;i++)
{
for(int j=0;j<rect2_col;j++)
{
rect2[i][j]=scanner.nextInt();
}
}
for (int i = 0; i < result.length; i++) {
for (int j = 0; j < result[0].length; j++) {
for (int k = 0; k < rect1_col; k++) {
result[i][j] += rect1[i][k] * rect2[k][j];
}
}
}
for (int i = 0; i < result.length; i++) {
for (int j = 0; j < result[0].length; j++) {
System.out.print(result[i][j] + " ");
}
System.out.println();
}
最后附上矩阵阶乘的算法
//2个矩阵相乘
Scanner scanner=new Scanner(System.in);
//矩阵为N*N
System.out.print("输入N:");
int N=scanner.nextInt();
//矩阵的阶乘
System.out.print("输入P:");
int P=scanner.nextInt();
int[][] rect=new int[N][N];
int[][] result=new int[N][N];
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
rect[i][j]=scanner.nextInt();
result[i][j]=rect[i][j];
}
}
while (P>1)
{
//创建临时矩阵,存储每一次计算的结果
int[][] c=new int[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
for (int k = 0; k < N; k++) {
c[i][j] += result[i][k] * rect[k][j];
}
}
}
//临时矩阵保存的每次计算的值,赋值给结果result[N][N]
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
result[i][j]=c[i][j];
}
}
P--;
}
//输出结果
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
System.out.print(result[i][j] + " ");
}
System.out.println();
}