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

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

typedef struct node {
    int data;
    struct node* next;
} node;
int main() {
    int n;
    scanf("%d", &n);
    node* a = malloc(sizeof(node)), *t1 = a;
    node* b = malloc(sizeof(node)), *t2 = b, *t3 = b;
    for (int i = 0; i < n * 2; i++) {
        node* t = malloc(sizeof(node));
        scanf("%d", &t->data);
        if (i < n) {
            t1->next = t;
            t1 = t;
        } else {
            t2->next = t;
            t2 = t;
        }
    }
    while (n--) {
        t3->next->data += a->next->data;
        t3 = t3->next;
        a = a->next;
    }
    while (b->next) {
        printf("%d ", b->next->data);
        b = b->next;
    }
    return 0;
}