蓝桥杯算法训练VIP-链表数据求和操作 （C语言代码）

解题思路:写一个创建链表函数，然后遍历链表，

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

typedef struct Data{

     int i;

     int j;

     struct Data *next;

}data;

data *creatL(int n);

int main()

{

     data *head;

     head = creatL(10);

     int s1=0, s2 = 0;

     data *temp = head->next;

     while (temp != NULL)

     {

         s1 += temp->i;

         s2 += temp->j;

         temp = temp->next;

     }

     printf("%d+%di", s1, s2);

     return 0;

}

data *creatL(int n)

{

     data *head, *node, *end;

     head = (data *)malloc(sizeof(data));

     end = head;

     for (int i = 0; i < n; i++)

     {

     node = (data *)malloc(sizeof(data));

     scanf("%d %d", &node->i, &node->j);

     end->next = node;

     end = node;

     }

     end->next = NULL;

     return head;

}