这个和数据结构理论的第12题一样,所以我直接把12题的代码复制粘贴了过来,然后只把main函数中的:
int t1,t2;
scanf("%d%d",&t1,&t2);改成了下面这样:
int m,n,t1,t2;
scanf("%d%d%d%d",&m,&n,&t1,&t2);然后我就直接提交AC了。
具体12题的链接看这里:(2条消息) 西工大NOJ数据结构理论——012.以三元组表为存储结构实现矩阵相加(耿5.7)_没耳朵的Rabbit的博客-CSDN博客
有一种输入输出上的错误案例,是下面这样:
void output(typelist *list)
{
int i=0;
printf("\n");
while(i<list->ln){
printf("%d %d %d\n",list->t[i].r,list->t[i].c,list->t[i].value);
i++;
}
}
而正确的应该是:
void output(typelist *list)
{
int i=0;
while(i<list->ln){
printf("%d %d %d\n",list->t[i].r,list->t[i].c,list->t[i].value);
i++;
}
}
也就是去掉“printf("\n");”
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
typedef struct Triple{
int i,j;//行号与列号
int x;
}Triple;//定义三元组类型
typedef struct TSMatrix{
Triple data[1000];
int mu,nu,tu;
//行数、列数和非零元个数
}TSMatrix;
void Insert(TSMatrix *tsmatrix,int i,int j,int x,int k){
//把第i行,第j列的元素x插入到三元组表的第k个位置
tsmatrix->data[k].i=i;
tsmatrix->data[k].j=j;
tsmatrix->data[k].x=x;
tsmatrix->tu=tsmatrix->tu+1;
}
void CreateTsmatrix(TSMatrix* tsmatrix,int t){//向三元组表中填充数据
int mumax=0;
int numax=0;
for(int k=0;k<t;k++){
int i,j,x;
scanf("%d %d %d",&i,&j,&x);
Insert(tsmatrix,i,j,x,k);
if(mumax<i) mumax=i;
if(numax<j) numax=j;
}
tsmatrix->mu=mumax;
tsmatrix->nu=numax;
}
TSMatrix* CreateEmptyTsmatrix(){//创建空三元组表
TSMatrix *tsmatrix=(TSMatrix*)malloc(sizeof(TSMatrix));
if(tsmatrix==NULL){
printf("Out of space!\n");
}else{
tsmatrix->mu=0;
tsmatrix->nu=0;
tsmatrix->tu=0;
return tsmatrix;
}
}
void Output(TSMatrix* tsmatrix){//输出三元组表中所有数据
for(int k=0;k<tsmatrix->tu;k++){
printf("%d %d %d\n",tsmatrix->data[k].i,tsmatrix->data[k].j,tsmatrix->data[k].x);
}
}
void ADDFUNCTION(TSMatrix* tsmatrix1,TSMatrix* tsmatrix2,TSMatrix* tsmatrix_total){
tsmatrix_total->mu=tsmatrix1->mu;
tsmatrix_total->nu=tsmatrix1->nu;
int k1=0;
int k2=0;
int k_total=0;
while((k1<tsmatrix1->tu)&&(k2<tsmatrix2->tu)){
if(tsmatrix1->data[k1].i<tsmatrix2->data[k2].i){//1的行数小
Insert(tsmatrix_total,tsmatrix1->data[k1].i,
tsmatrix1->data[k1].j,
tsmatrix1->data[k1].x,
k_total);
k1++;
k_total++;
}else if(tsmatrix1->data[k1].i>tsmatrix2->data[k2].i){//1的行数大
Insert(tsmatrix_total,tsmatrix2->data[k2].i,
tsmatrix2->data[k2].j,
tsmatrix2->data[k2].x,
k_total);
k2++;
k_total++;
}else if(tsmatrix1->data[k1].j<tsmatrix2->data[k2].j){//1的列数小
Insert(tsmatrix_total,tsmatrix1->data[k1].i,
tsmatrix1->data[k1].j,
tsmatrix1->data[k1].x,
k_total);
k1++;
k_total++;
}else if(tsmatrix1->data[k1].j>tsmatrix2->data[k2].j){//1的列数大
Insert(tsmatrix_total,tsmatrix2->data[k2].i,
tsmatrix2->data[k2].j,
tsmatrix2->data[k2].x,
k_total);
k2++;
k_total++;
}else{//1和2的行数、列数均相同
int sum=tsmatrix1->data[k1].x+tsmatrix2->data[k2].x;
if(sum!=0){
Insert(tsmatrix_total,tsmatrix1->data[k1].i,
tsmatrix1->data[k1].j,
sum,
k_total);
k1++;
k2++;
k_total++;
}else{
k1++;
k2++;
}
}
}
while(k2<tsmatrix2->tu){
Insert(tsmatrix_total,tsmatrix2->data[k2].i,
tsmatrix2->data[k2].j,
tsmatrix2->data[k2].x,
k_total);
k2++;
k_total++;
}
while(k1<tsmatrix1->tu){
Insert(tsmatrix_total,tsmatrix1->data[k1].i,
tsmatrix1->data[k1].j,
tsmatrix1->data[k1].x,
k_total);
k1++;
k_total++;
}
}
int main(){
int m,n,t1,t2;
scanf("%d%d%d%d",&m,&n,&t1,&t2);
TSMatrix* tsmatrix1=CreateEmptyTsmatrix();
TSMatrix* tsmatrix2=CreateEmptyTsmatrix();
TSMatrix* tsmatrix_total=CreateEmptyTsmatrix();
CreateTsmatrix(tsmatrix1,t1);
CreateTsmatrix(tsmatrix2,t2);
ADDFUNCTION(tsmatrix1,tsmatrix2,tsmatrix_total);
//实现矩阵相加
Output(tsmatrix_total);
return 0;
}