链表实现复数求和（头插+尾插）C语言实现

解题思路:

注意事项:

参考代码:<1.尾插版>

#include<stdio.h>

#include<malloc.h> 

#include<stdlib.h>

typedef struct number{

int shi;

int xu;

struct number *next;

}Node,*pNode;

int main(){

int n=10,val1,val2;

int sum1=0,sum2=0;

pNode p,s,head;

head=p=(pNode)malloc(sizeof(Node));

// p->next=NULL;

while(n--){

s=(pNode)malloc(sizeof(Node));

scanf("%d",&val1);

scanf("%d",&val2);

s->shi=val1;

s->xu=val2;

// s->next=p->next;

// p->next=s;

p->next=s;

p=s;

}

p->next=NULL;

p=head->next;

while(p!=NULL){

sum1=sum1+p->shi;

sum2=sum2+p->xu;

p=p->next;

}

printf("%d+%di",sum1,sum2);

return 0;

} 

<2.头插版>

#include<stdio.h>

#include<malloc.h> 

#include<stdlib.h>

typedef struct number{

int shi;

int xu;

struct number *next;

}Node,*pNode;

int main(){

int n=10,val1,val2;

int sum1=0,sum2=0;

pNode p,s;

p=(pNode)malloc(sizeof(Node));

p->next=NULL;

while(n--){

s=(pNode)malloc(sizeof(Node));

scanf("%d",&val1);

scanf("%d",&val2);

s->shi=val1;

s->xu=val2;

s->next=p->next;

p->next=s;

}

p=p->next;

while(p!=NULL){

sum1=sum1+p->shi;

sum2=sum2+p->xu;

p=p->next;

}

printf("%d+%di",sum1,sum2);

return 0;

}