求矩阵的转置
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 1000
typedef int ElementType;
typedef struct
{
int row,col;
ElementType e;
}Triple;
typedef struct
{
Triple data[MAXSIZE+1];
int mu,nu,tu;
}TSMatrix,*PTSMatrix;
void initMatrix(TSMatrix *M,int n,int m)
{
M=(TSMatrix *)malloc(sizeof(TSMatrix));
M->mu=n;
M->nu=m;
M->tu=0;
}
void enter(TSMatrix *M,int n,int m)
{
int k=0;
int i,j,e;
while(1)
{
scanf("%d %d %d",&i,&j,&e);
if(i==0&&j==0&&e==0)
break;
else{
k++;
M->data[k].row=i;
M->data[k].col=j;
M->data[k].e=e;
M->tu++;
}
}
}
void TransposeSMatrix(TSMatrix M,TSMatrix *T)
{
int t,p,q,col;
int num[MAXSIZE],position[MAXSIZE];
T->nu=M.mu;
T->mu=M.nu;
T->tu=M.tu;
if(T->tu)
{
for(col=1;col<=M.nu;col++){
num[col]=0;}
for(t=1;t<=M.tu;t++){
num[M.data[t].col]++;//采用数组下标计算每一列非零元素的个数
position[1]=1;}
for(col=2;col<=M.nu;col++){// 求col列第一个非零元素的位置
position[col]=position[col-1]+num[col-1];}
for(p=1;p<=M.tu;p++)
{
col=M.data[p].col;
q=position[col];
T->data[q].row=M.data[p].col;
T->data[q].col=M.data[p].row;
T->data[q].e=M.data[p].e;
position[col]++;
}
}
}
int main()
{
int n,m;
scanf("%d %d",&n,&m);
TSMatrix M;
TSMatrix *T;
T=(TSMatrix *)malloc(sizeof(TSMatrix));
initMatrix(&M,n,m);
enter(&M,n,m);
TransposeSMatrix(M,T);
for(int i=1;i<=T->tu;i++)
{
printf("%d %d %d\n",T->data[i].row,T->data[i].col,T->data[i].e);
}
return 0;
}