蓝桥杯算法提高VIP-复数求和 （C语言代码）使用链表求解

#include<stdio.h>
#include<stdlib.h>
typedef struct _complex{
    int real;
    int imag;
    struct  _complex *Next;
}complex;
int main()
{
    complex * head =NULL;
    int T;
    int real,imag;
    int s_r,s_i;
    s_r=s_i=0;
    scanf("%d",&T);
    while(T--)
    {
        complex *p = (complex*)malloc(sizeof(complex));
        scanf("%d%d",&real,&imag);
        p->real=real;
        p->imag=imag;
        p->Next=NULL;
        complex *now =head;
        if(now)
        {
            while(now->Next)
            {
                now=now->Next;
            }
            now->Next=p;
        }else
        {
            head = p;
        }
    }
    while(head)
    {
        s_i+=head->imag;
        s_r+=head->real;
        head=head->Next;
    }
    printf("%d+%di",s_r,s_i);
    return 0;
}

如果希望看到更多的代码，欢迎光临我的网站