题解 | #牛牛的单链表求和#

#include <stdio.h>
#include <stdlib.h>

typedef struct Node{
    int num;
    struct Node* next;
}NodeList;

NodeList* Init(){
    NodeList *p;
    p=(NodeList*)malloc(sizeof(NodeList));
    p->next=NULL;
    return p;
}

void CreateList(NodeList* head,int num){
    NodeList* p;
    for(int i=0;i<num;i++){
        p=Init();
        p->next=head->next;
        head->next=p;
        p=NULL;
    }
}

void DeleteList(NodeList* head){
    NodeList* p=head->next,*q;
    if(p){
        q=p->next;
        free(p);
        p=q;
    }
    free(head);
}

int main() {
    int num,sum=0;
    NodeList* head,*p;
    scanf("%d",&num);
    head=Init();
    CreateList(head, num);
    p=head->next;
    for(int i=0;i<num;i++){
        scanf("%d ",&(p->num));
        sum+=p->num;
        p=p->next;
    }
    printf("%d",sum);
    DeleteList(head);

}