简单的链表问题，本题解没有进行去除节点时的内存删除

typedef struct node
{
    int var;
    struct node* next;
}Node;

#define NULL 0

int main()
{
    int n,i;
    int a,b;//临时调用
    scanf("%d", &n);
    Node* head = (Node *)malloc(sizeof(Node));
    scanf("%d", &head->var);
    head->next = NULL;
    Node* tmp;
    Node* now;
    
    for(i=1; i<n; i++)
    {
        scanf("%d %d", &a, &b);
        tmp = head;
        while(tmp->var != b)
        {
            tmp = tmp->next;
        }
        now = (Node *)malloc(sizeof(Node));
        now->var = a;
        now->next = tmp->next;
        tmp->next = now;
    }
    scanf("%d", &b);
    if(head->var == b)
    {
        head = head->next;
    }
    else
    {
        tmp = head;
        while(tmp->next->var != b)
        {
            tmp = tmp->next;
        }
        tmp->next = tmp->next->next;
    }
    while(head != NULL)
    {
        printf("%d ", head->var);
        head = head->next;
    }
    return 0;
}