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

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

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

int main(int argc, char const *argv[])
{
    int n,i;
    scanf("%d", &n);
    LinkNode *head = (LinkNode *)malloc(sizeof(LinkNode));
    LinkNode *tail;
    head->next = NULL;
    scanf("%d", &head->num);
    tail = head;
    for (i = 0; i < n-1; ++i)
    {
        LinkNode *p = (LinkNode *)malloc(sizeof(LinkNode));
        scanf("%d", &p->num);
        p->next = NULL;
        tail->next = p;
        tail = tail->next;
    }
    tail = head;
    int max = 0;
    while(tail != NULL){
        max += tail->num;
        tail = tail->next;
    }
    printf("%d", max);
}