#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX_ROW 3
#define MAX_COL 3
void Change_row_col(int a[MAX_ROW][MAX_COL])
{
//1 2 3
//4 5 6
// 7 8 9
int b[MAX_ROW][MAX_COL] = { 0 };
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
b[col][row] = a[row][col];
}
}
for (int row = 0; row < MAX_ROW; row++)
{
for (int col = 0; col < MAX_COL; col++)
{
a[row][col] = b[row][col];
}
}
}
int main()
{
int a[MAX_ROW][MAX_COL] = { 1,2,3,4,5,6,7,8,9 };
Change_row_col(a);
for (int i = 0; i < MAX_ROW; i++)
{
for (int j = 0; j < MAX_COL; j++)
{
printf("%5d", a[i][j]);
}
printf("\n");
}
system(“pause”);
return 0;
}
求矩阵的逆
最新推荐文章于 2025-06-22 04:23:58 发布