链表

1.单链表基本题型：

#include<iostream>
using namespace std;
struct Node
{
    int data;
    Node *next;
};
class Linklist
{
    Node *first;


    public:
    Linklist();
    Linklist(int a[],int n);
    ~Linklist();
    void getvalve(int i);
    void locate(int i);
    Linklist(int a[],int n,int m);
    void print();
};
Linklist::Linklist()
{
    first=new Node;
    first->next=NULL;
}
Linklist::Linklist(int a[],int n)
{
    first=new Node;
    first->next=NULL;
    for(int i=0;i<n;i++)
    {
        Node*s=NULL;
        s=new Node;
        s->data=a[i];
        s->next=first->next;
        first->next=s;
    }

}
Linklist::~Linklist()
{
    Node *p;
    while(first->next!=NULL)
    {
        p=first->next;
        delete first;
        first=p;
    }
    delete first;
}
void Linklist::getvalve(int i)
{
    int x=0;
    Node *p=first;
    Node *q=NULL;
    while(p->next!=NULL)
    {
        if(p->next->data==i)
        {
            q=p->next;
            p->next=q->next;
            delete q;
            x=1;
        }
        else
        p=p->next;
    }
    if(x==0)
        cout<<"Error"<<endl;
    else
    {
        this->print();
    }
}
void Linklist::print()
{
    Node *p=first->next;
    while(p!=NULL)
    {
        cout<<p->data<<' ';
        p=p->next;
    }
    cout<<endl;
}
void Linklist::locate(int i)
{
    int count=0;
    Node *p=first;
    Node *q=NULL;
    int x;
    while(p!=NULL&&count<i-1)
    {
        p=p->next;
        count++;
    }
    if(p==NULL||p->next==NULL||i==0)
    {
       cout<<"Error"<<endl;
    }
    else{
                q=p->next;
                x=p->next->data;
                p->next=q->next;
                delete q;
                this->print();
    }
}
Linklist::Linklist(int a[],int n,int m)
{
    first=new Node;
    Node *r=first;
    Node *s=NULL;
    for(int i=0;i<n;i++)
    {
        s=new Node;
        s->data=a[i];
        r->next=s;
        r=s;
    }
    r->next=NULL;
}
int main()
{
    int a[1000];
    int b[1000];
    int count=0;
    int s=1;
    while(cin>>s)
    {
        if(s==0)
            break;
        a[count]=s;
        count++;
    }
    s=1;
    Linklist L(a,count,0);
    count=0;
    while(cin>>s)
    {
        if(s==0)
            break;
        b[count]=s;
        count++;
    }
    Linklist K(b,count);
    L.print();
    K.print();
    int num1,num2;
    cin>>num1>>num2;
    L.getvalve(num1);
    L.locate(num2);
}

2.双链表基本题型

#include<iostream>
#include<algorithm>
using namespace std;
struct Node
{
    int data;
    Node *llink;
    Node *rlink;
};
class List
{
    private:
    Node *first;
    public:
    List(int a[],int n);
    ~List();
    void print();
    void insert(int n);
    void Delete(int n);
};
List::List(int a[],int n)
{
    Node *s,*p;
    s=new Node;
    s->llink;
    s->rlink;
    first=s;
    p=first;
    for(int i=0;i<n;i++)
    {
        s=new Node;
        s->data=a[i];
        s->llink=p;
        p->rlink=s;
        p=s;
    }
    p->rlink=NULL;
}
void List::insert(int n)
{
    Node *p,*s;
    p=first->rlink;
    int flag=1;
    while(p)
    {
        if(p->data>=n)
        {
            s=new Node;
            s->data=n;
            s->rlink=p;
            s->llink=p->llink;
            p->llink->rlink=s;//
            p->llink=s;
            flag=0;
            break;
        }
    p=p->rlink;
    }
    if(flag)
    {
        Node *p,*s;
        p=first;
        while(p->rlink!=NULL)
        {
            p=p->rlink;
        }
        s=new Node;
        s->data=n;
        s->rlink=p->rlink;
        p->rlink=s;
        s->llink=p;
    }
}
void List::print()
{
    Node *p=first->rlink;
    while(p!=NULL)
    {
        cout<<p->data<<' ';
        p=p->rlink;
    }
}
void List::Delete(int n)
{
    Node *s,*p;
    p=first->rlink;
    while(p!=NULL)
    {
        if(p->data==n)
        {
            s=p;
            p->llink->rlink=p->rlink;
            if(p->rlink!=NULL)
            p->rlink->llink=p->llink;
            delete s;
        }
        p=p->rlink;
    }
}
List::~List()
{
    Node *p;
    p=first->rlink;
    while(p)
    {
        delete first;
        first=p;
        p=p->rlink;
    }
}
int main()
{
    int a[10000];
    int i=0;
    int s=1;
    int x=1;
    int y=1;
    while(cin>>s)
    {
        if(s==0)
        break;
        a[i]=s;
        i++;
    }
    sort(a,a+i);
    List L(a,i);
    L.print();
    cout<<endl;
    while(cin>>x)
    {
        if(x==0)
            break;
        L.insert(x);
    }
    L.print();
    cout<<endl;
    while(cin>>y)
    {
        if(y==0)
            break;
        L.Delete(y);
    }
    L.print();
    return 0;
}