蓝桥杯算法训练VIP-链表数据求和操作-题解(C++代码)

#include<iostream>
#include<stdlib.h>
using namespace std;
typedef struct Link {
    int real,imag;
    struct Link *next;
} link;
int sum1=0,sum2=0;
link *init(int n) {
    link *head,*p,*q;
    head=(link *)malloc(sizeof(link));
    p=head;
    while(n--) {
        q=(link *)malloc(sizeof(link));
        cin>>q->real>>q->imag;
        sum1+=q->real;
        sum2+=q->imag;
        p->next=q;
        p=q;
        getchar();
    }
    return head;
}
int main() {
    link *head=init(10);
    cout<<sum1<<"+"<<sum2<<"i";
    return 0;
}