73.链表的基本操作

#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int n;
struct LinkList
{
    int value;//数据域
    struct LinkList *next;//指针域
}*head;

void init()
{
    cout<<"                           线性链表"<<endl;
    cout<<endl;
    cout<<"                      (1)设置线性链表中的元素"<<endl;
    cout<<endl;
    cout<<"                      (2)查找线性链表中的元素"<<endl;
    cout<<endl;
    cout<<"                      (3)删除线性链表中的元素"<<endl;
    cout<<endl;
    cout<<"                      (4)统计线性链表中元素的总数"<<endl;
}

void Add()
{
    cout<<endl;
    int addNum,addvalue;//元素的个数及数值
    cout<<"                      请输入将要设置链表元素的个数："<<endl;
    cout<<endl;
    cout<<"                      ";
    cin>>addNum;
    cout<<endl;
    cout<<"                      请依次输入将要设置的元素的值："<<endl;
    cout<<endl;
    head=new LinkList;
    head->next=NULL;
    struct LinkList *q,*p;
    p=head;
    cout<<"                      ";
    while(addNum--){
        q=new LinkList;
        q->next=NULL;
        cin>>addvalue;
        p->value=addvalue;
        p->next=q;
        p=q;
    }
    cout<<endl;
    cout<<"                      输入完毕 !!!"<<endl;
    cout<<endl;
}

void Delete()
{
    cout<<endl;
    struct LinkList *k,*v;
    k=head;
    cout<<"                      请输入要删除的元素"<<endl;
    cout<<endl;
    int deletevalue;
    cout<<"                      ";
    cin>>deletevalue;
    cout<<endl;
    while(k->next){
        if(k->next->value==deletevalue){
            v=k->next;
            k->next=v->next;
            delete v;
        };
        k=k->next;
    }
    cout<<endl;
    cout<<"                      删除完毕 !!!"<<endl;
    cout<<endl;
}

void Find()
{
    cout<<endl;
    struct LinkList *k;
    k=head;
    cout<<"                      请输入要查找的元素："<<endl;
    cout<<endl;
    int Findvalue;
    cout<<"                      ";
    cin>>Findvalue;
    cout<<endl;
    int flag=0;
    int i=1;
    while(k->next!=NULL){
        if(k->value==Findvalue){
            flag=1;
            break;
        }
        k=k->next;
        i++;
    }
    if(flag){
        cout<<"                      要查找的元素找到了!!!它在第"<<i<<"个位置"<<endl;
    }else{
        cout<<"                      所查找的值不存在!!!"<<endl;
    }
    cout<<endl;

}

void Count()
{
    cout<<endl;
    struct LinkList *k;
    k=head;
    int sum=0;
    while(k->next!=NULL){
        sum++;
        k=k->next;
    }
    cout<<"                      线性链表元素的总数为："<<sum<<"个"<<endl;
    cout<<endl;
}

void Put()
{
    struct LinkList *k;
    k=head;
    cout<<"线性链表中元素依次为："<<endl;
    cout<<endl;
    cout<<"                      ";
    while(k->next!=NULL){
        cout<<k->value<<" ";
        k=k->next;
    }
    cout<<endl;
    cout<<endl;
}

int main()
{
    init();
    while(1){
        cout<<endl;
        cout<<"                      请按下功能键 ..."<<endl;
        cout<<endl;
        cout<<"                      ";
        cin>>n;
        if(n==1) Add();
        if(n==2) Find();
        if(n==3) {
            cout<<endl;
            cout<<"                      删除操作前";
            Put();
            Delete();
            cout<<"                      删除操作后";
            Put();
        }
        if(n==4) Count();
        if(n<1||n>4){
            cout<<endl;
            cout<<"                      功能键不存在请重新输入!!!"<<endl;
            cout<<endl;
        }
        cout<<"                      -----------------------"<<endl;
        cout<<endl;
        init();
    }
    return 0;
}