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

#include <stdio.h>
#include<malloc.h>

typedef struct node {
    int data;
    struct node* next;
} node;
int main() {
    int n, sum = 0;
    scanf("%d", &n);
    node* head = malloc(sizeof(node)), *t = head;
    while (n--) {
        scanf("%d", &t->data);
        node* node = malloc(sizeof(node));
        t->next = node;
        t = t->next;
    }
    while (head->next) {
        sum += head->data;
        head = head->next;
    }
    printf("%d\n", sum);
    return 0;
}