805 模拟卷 链表题

#include <stdio.h>
#include <stdlib.h>    //填空
#include "string.h"

typedef struct node{
    int n;
    struct node *next;   //填空
}Node;
void show(Node *head){
    while (head){
        printf("%d ",head->n);
        head = head->next;
    }
    printf("\n");
}
Node *newNode(int n,Node *next){
    Node *node=(Node *)malloc(sizeof(Node));  //填空
    node->n=n;
    node->next=next;  //填空
    return node;
}
Node *newList(int a[],int n){
    int i;
    Node *head = NULL,*tail;
    for (int i = 0; i < n; ++i) {
        Node *t = newNode(a[i],NULL);     //填空
        if (head == NULL)   //填空
            head=t;      //填空
        else
            tail->next=t;
        tail = t;
    }
    return head;
}
Node *delete(Node *head){
    Node *p=head,*q;
    while (p && p->next){
        if (p->n != p->next->n)
            p=p->next;
        else
            p->next = p->next->next;     //填空
    }
    return head;
}
int main(){
    int data[]={1,1,2,2,3,3,4,4,5,5,6,6};
    int n = sizeof(data) / sizeof(int);
    Node *head = newList(data,n);     //填空
    head = delete(head);
    show(head);
    return 0;
}