c语言：二维数组行列互换 c语言二维数组行列互换
c\u8bed\u8a00 \u5c06\u4e00\u4e2a\u4e8c\u7ef4\u6570\u7ec4\u884c\u548c\u5217\u7684\u5143\u7d20\u4e92\u6362\uff0c\u5b58\u5230\u53e6\u4e00\u4e2a\u4e8c\u7ef4\u6570\u7ec4\u3002\u4f60\u5f00\u59cb\u7684\u65f6\u5019\u58f0\u660e\u548c\u8d4b\u503c\u9519\u4e86\u3002
\u5728\u7b2c\u56db\u884c\uff0cint a[2][3]{{1,2,3},{4,5,6}};
\u6539\u6210\uff1aint a[2][3] = {{1,2,3},{4,5,6}};
\u5c31\u53ef\u4ee5\u4e86\uff01
\u8bbf\u95ee\u65b9\u5f0f\u53d8\u4e00\u4e0b\u5c31\u884c\u4e86 x \u6539\u4e3a y y\u6539\u4e3ax
由于行、列不确定，所以要动态处理。举例代码如下：
//#include "stdafx.h"//If the vc++6.0, with this line.
#include "stdio.h"
#include "stdlib.h"
int main(void){
int **a,**b,m,n,i,j;
while(1){//保证输入的行、列数为正数
printf("Please enter m & n(int m>0,n>0)...
");
if(scanf("%d%d",&m,&n),m>0 && n>0)
break;
printf("Error, redo: ");
}
a=(int **)malloc((j=sizeof(int))*m);
b=(int **)malloc(j*n);
if(a==NULL || b==NULL){
printf("Application memory failure...
");
exit(0);
}
for(i=0;i<m;i++)
if((a[i]=(int *)malloc(j*n))==NULL){
printf("Failed to create the array...
");
exit(0);
}
for(i=0;i<n;i++)
if((b[i]=(int *)malloc(j*m))==NULL){
printf("Failed to create the array...
");
exit(0);
}
for(i=0;i<m;i++)
for(j=0;j<n;scanf("%d",a[i]+j++));
printf("
");
for(i=0;i<n;i++){
for(j=0;j<m;j++)
printf("%d ",b[i][j]=a[j][i]);//a的行、列互换后存入b
printf("
");
}
for(i=0;i<m;free(a[i++]));
free(a);
for(i=0;i<n;free(b[i++]));
free(b);
return 0;
}
你的意思是a[i][j]的数组就保存a[j][i]? 那头一个数应该不会变啊
只需要换二维数组下标即可，不需要借用中间数组b[][]
#include "stdio.h"
void main()
{
int **a;
int row,col;
int i,j;
printf("Please input row and col:\n");
scanf("%d%d",&row,&col);
printf("Please input data:\n");
a=(int**)malloc(row*sizeof(int));
for(i=0;i<row;i++)
a[i]=(int*)malloc(col*sizeof(int));
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
printf("Result:\n");
for(i=0;i<col;i++)
{
for(j=0;j<row;j++)
printf("%d ",a[j][i]);
printf("\n");
}
}
如果对你有所帮助，请记得采纳最佳答案，谢谢！
#include<stdio.h>
main()
{
int a[20][20];
int m,n,i,j;
scanf(
void zhuanhuan(int a[MAX1][],int b[MAX2][],int m,int n)
{
int i,j;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
b[i][j]=a[j][i];
for(i=0;i<m;i++)
for(j=0;j<n;j++)
printf("%d ",b[i][j]);
if(i<m-1) printf("\n");
}
绛旓細include <stdio.h> void tran();int b[3][5],a[5][3];void main(){ int i,j;for(i=0;i<5;i++){ for(j=0;j<3;j++){ scanf("%d",&a[i][j]);} } tran();printf("杞疆\n");for(i=0;i<3;i++){ for(j=0;j<5;j++){ printf("%d ",b[i][j]);} printf...
绛旓細include<stdio.h> void main() {void change(int arr1[2][3],int arr2[3][2]); int arr1[2][3]={{1,2,3},{4,5,6}},arr2[3][2]; int i,j; printf("\nThe original array:\n"); for(i=0;i<2;i++) {for(j=0;j<3;j++) printf(" %d",arr1[i][j]); ...
绛旓細b[j] [i]=a[i] [j]杩欏氨鏄疄鐜扮煩闃佃浆缃簡銆俰琛宩鍒椾笌j琛宨鍒楄繘琛浜ゆ崲锛屼娇鐢ㄤ腑闂村彉閲忔潵瀹炵幇浜ゆ崲鍊笺
绛旓細杩欎釜闂鍙灏鏁扮粍鐨勫彸涓婁笁瑙掑舰鏁颁笌宸︿笅浜ゆ崲鍗冲彲銆倂oid main(){ char str[4][5]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};int i,j,t=0;for(i=0;i<=3;i++){ for(j=0;j<=3;j++){ printf("%2d ",str[i][j]);} printf("\n");} for(i=0;i<=3;i++)...
绛旓細include "stdio.h"void main(){ int a[3][4] = {{1,2,3,4},{5,6,7,8},{9,0,1,2}};int b[4][3];int i, j;printf("before transform :\n");for(i=0; i<3; i++){ for(j=0; j<4; j++){ b[j][i] = a[i][j];printf("%4d", a[i][j]);} printf("...
绛旓細杩欎袱涓潗鏍囧垎鍒唬琛ㄨ鍜屽垪锛屾墍浠モ琛屽垪浜掓崲鈥濆疄闄呬笂灏辨槸杩欎袱涓潗鏍囦簰鎹㈠晩銆傛瘮濡傜2琛岀3鍒楁崲鎴愮3琛岀2鍒楋紝涓嶅氨鏄痓[3][2]=a[2][3]鍚楋紵
绛旓細define N 5 void main(){ int a[N][N] = {0};/* 鍒濆艰嚜宸卞啓鍚 */ int i, j, iTemp;for ( i = 1; i < N; ++i ){ for ( j = 0, j < i; ++j ){ iTemp = a[i][j];a[i][j] = a[j][i];a[j][i] = iTemp;} } return;} ...
绛旓細include <iostream> //杞疆鏁扮粍 using namespace std;define SIZE 100 void main(){ int arr1[SIZE][SIZE];int arr2[SIZE][SIZE];int m, n, i, j;cout << "杈撳叆M N锛";cin >> m >> n;for (i = 0; i != m; ++i){ for (j = 0; j != n; ++j){ cin >> arr1[...
绛旓細//褰撹鍒椾笉鐩哥瓑鏃讹紝涓嶅湪鍦ㄨ嚜韬笂杩涜杞疆鐨勶紝鍙兘灏琛屽垪浜掓崲鐨勭粨鏋滃瓨鍏ュ彟涓鏁扮粍銆俰nclude<stdio.h> define M 4 define N 5 void main(){ int a[M][N]={{1,2,3,4,5},{6,7,8,9,10},{11,12,13,14,15},{16,17,18,19,20}};int b[N][M];int i,j;for(i=0;i<M;i++)...
绛旓細include"stdio.h"main(){ int a[2][3],i,j,b[3][2];//瀹氫箟鍙︿竴涓鏁扮粍 for(i=0;i<2;i++)for(j=0;j<3;j++){ scanf("%d",a[i][j]);b[j][i]=a[i][j];}//澶ф嫭鍙凤紝缁欏彟涓涓暟缁勮祴鍊硷紱for(i=0;i<3;i++)for(j=0;j<2;j++)printf("%d\n",b[i][j]);} ...
