链表的重要总结 系列二

输出 链表的函数。

void input(struct node *head)
{
    struct node *tail;
    for(tail = head -> next; tail != NULL; tail = tail -> next)
    {
        printf("%d", tail -> data);
        if(tail -> next != NULL)
            printf(" ");
        else printf("\n");
    }
}

对于含有头结点的 n个结点的链表， 删除相同数据的结点，记录剩下结点的数量并返回的函数。

int del(struct node *head, int n)
{
    struct node *p, *tail, *t;
    for(p = head -> next; p -> next != NULL; p = p -> next)
    {
        tail = p;
        t = tail -> next;
        while(t -> next != NULL)
        {
            if(p -> data == t -> data)
            {
                tail -> next = t -> next;
                free(t);
                n--;
                t = tail -> next;
            }
            else
            {
                tail = t;
                t = t -> next;
            }
        }
        if(t -> next == NULL)
        {
            if(t -> data == p -> data)
            {
                tail -> next = NULL;
                free(t);
                n--;
            }
        }
    }
    return n;
}