数据结构上机测试2-1:单链表操作A

来源：互联网发布：猪湾事件知乎编辑：程序博客网时间：2024/06/16 02:18
#include <iostream>#include <algorithm>#include <string>using namespace std;typedef struct node{    int data;    node *next;}Linklist;Linklist *head, *p, *tail, *q;void nxcreat(int n)///逆序键链表{    head=new Linklist;    head->next=NULL;    while(n--)    {        p=new Linklist;        cin>>p->data;        p->next=head->next;        head->next=p;    }}void sxcreat(int n)  ///顺序建链表{    head=new Linklist;    head->next=NULL;    tail=head;    while(n--)    {        p=new Linklist;        cin>>p->data;        p->next=NULL;        tail->next=p;        tail=p;    }}void display(){    p=head->next;    while(p->next)    {        cout<<p->data<<" ";        p=p->next;    }    cout<<p->data<<endl;}int del1(int n)///单链表重读元素删除{    Linklist *t;    p=head->next;    while(p)    {        t=p;        q=p->next;        while(q)        {            if(p->data==q->data)            {                n--;                t->next=q->next;                free(q);                q=t->next;            }            else            {                q=q->next;                t=t->next;            }        }        p=p->next;    }    return n;}int del2(int n, int key)///删除值为key的节点{    p=head;    while(p->next)    {        if(p->next->data==key)        {            n--;            q=p->next;            p->next=q->next;            free(q);        }        else p=p->next;    }    return n;}int main(){    int n, m;    cin>>n;    sxcreat(n);    cin>>m;    cout<<n<<endl;    display();    cout<<del2(n, m)<<endl;    display();    return 0;}
1 0