数据结构实验之链表七：单链表中重复元素的删除

Problem Description

Input

Output

Example Input

10
21 30 14 55 32 63 11 30 55 30

Example Output

10
30 55 30 11 63 32 55 14 30 21
7
30 55 11 63 32 14 21

Hint

Author

不得使用数组！

#include <bits/stdc++.h>
using namespace std;
typedef struct node
{
   int data;
   struct node*next;
}st;
st*head,*p;
int n;
st*delet(st*head)
{
    st*q,*t,*p;
    p=head->next;
    while(p&&p->next)//注意此处
    {
        t=p;
        q=t->next;
        while(q!=NULL)
        {
            if(q->data==p->data)
            {
                t->next=q->next;
                q=t->next;
                n--;
            }
            else
            {
                t=q;
                q=q->next;
            }
        }
        p=p->next;
    }
    return head;
}
void show(st*head)
{
    p=head->next;
    while(p!=NULL)
    {
       cout<<p->data<<(p->next==NULL?'\n':' ');
        p=p->next;
    }
}
int main()
{
    int i;
    head=(st*)malloc(sizeof(st));
    head->next=NULL;
    cin>>n;
    for(i=0;i<n;i++)
    {
        p=(st*)malloc(sizeof(st));
        cin>>p->data;
        p->next=head->next;//逆向建表是逐个插入，所以p->next不为空
        head->next=p;

    }
    cout<<n<<endl;
    show(head);
    head=delet(head);
    cout<<n<<endl;
    show(head);
    return 0;
}