蓝桥杯算法训练VIP-链表数据求和操作

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<malloc.h>

#define I sizeof(struct a)

struct a{

int s;

int x;

struct a *next; 

};

int main(){

struct a *p,*p1,*p2;

int m,j,sum1=0,sum2=0;

p=(struct a *)malloc(I);

p1=p;

for(m=0;m<10;m++){

p2=(struct a *)malloc(I);

scanf("%d%d",&p2->s,&p2->x);

p1->next=p2;

p1=p2; 

}

for(j=0;j<10;j++){

p=p->next;

sum1+=p->s;

sum2+=p->x;

}

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

}