线性表链式结构基本操作的实现

2018-11-10-15:10:42

/*********************************************************
    创建一个带头结点的单链表，并实现其增删合并和打印等基本操作。
    main函数操作：
        1.输入第一个链表的元素个数，以及具体元素。
        2.打印该链表。
        3.输入需要插入在某个位置的值。
        4.打印插入后的链表。
        5.输入需要删除元素在链表中的位置。
        6.打印删除元素后的链表。
        7.输入第二个链表的元素个数，以及具体元素。
        8.返回二继续执行上述2-6步骤并在第六个步骤完成时跳出。
        9.将两个链表合并。
        10.打印合并后的链表。
**********************************************************/
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;

typedef int Elemtype;
typedef struct node{
    int length;//用头结点储存链表的当前长度
    Elemtype Date;
    struct node*Next;
}Node,*LinkList;

LinkList InitNode();
LinkList InsertNode(LinkList Head,Elemtype elem,int aidelem_locate);
LinkList DeleteNode(LinkList Head,Elemtype *elem,int aidelem_locate);
LinkList MergeList(LinkList&Head1,LinkList&Head2);
void Printlist(LinkList Head);
//main函数内所有数据均为测试数据，读者可根据自己测试方式自行调换
int main()
{
    LinkList Head1,Head2;
    Head1=InitNode();
    cout<<"List 1 : "<<endl;
    int Maxnumber1;
    Elemtype elem1;
    cin>>Maxnumber1;
    for(int i=1;i<=Maxnumber1;i++){
        cin>>elem1;
        InsertNode(Head1,elem1,i);
    }
    Printlist(Head1);
    Elemtype elem2;
    int index1;
    cin>>elem2>>index1;
    InsertNode(Head1,elem2,index1);
    Printlist(Head1);
    int elem3,index2;
    cin>>index2;
    DeleteNode(Head1,&elem3,index2);
    cout<<"Delete date is in ListHead1 is "<<elem3<<endl;
    Printlist(Head1);

    cout<<"List 2 : "<<endl;
    Head2=InitNode();
    int Maxnumber2;
    Elemtype elem4;
    cin>>Maxnumber2;
    for(int i=1;i<=Maxnumber2;i++){
        cin>>elem4;
        InsertNode(Head2,elem4,i);
    }
    Printlist(Head2);
    Elemtype elem5;
    int index3;
    cin>>elem5>>index3;
    InsertNode(Head2,elem5,index3);
    Printlist(Head2);
    int elem6,index4;
    cin>>index4;
    DeleteNode(Head2,&elem6,index4);
    cout<<"Delete date in ListHead2 is "<<elem6<<endl;
    Printlist(Head2);
    char c;
    cout<<"Are you sure you want to merge the two lists above?"<<endl<<"input Y or N "<<endl;
    cin>>c;
    if(c=='Y'){
        LinkList Merge;
        Merge=MergeList(Head1,Head2);
        Printlist(Merge);
    }
    return 0;
}

LinkList InitNode(){
    LinkList Head;
    Head=(LinkList)malloc(sizeof(Node));
    Head->Next=NULL;
    Head->length=0;
    return Head;
}

LinkList InsertNode(LinkList Head,Elemtype elem,int aidelem_locate){
    if(Head->Next==NULL){
        LinkList q;
        q=(LinkList)malloc(sizeof(Node));
        Head->Next=q;
        q->Date=elem;
        q->Next=NULL;
        Head->length++;
        return Head;
    }
    else if(aidelem_locate==Head->length+1){
        LinkList q,p;
        for(q=Head->Next;q->Next;q=q->Next);
        p=(LinkList)malloc(sizeof(Node));
        q->Next=p;
        p->Next=NULL;
        p->Date=elem;
        Head->length++;
        return Head;
    }
    else{
        if(aidelem_locate<=Head->length){
            int i;
            LinkList p,q;
            for(q=Head->Next,i=1;i<aidelem_locate-1;q=q->Next,i++);
            if(aidelem_locate==1)
                q=Head;
            p=(LinkList)malloc(sizeof(Node));
            p->Next=q->Next;
            q->Next=p;
            p->Date=elem;
            Head->length++;
            return Head;
        }
        else    return Head;
    }
}

LinkList DeleteNode(LinkList Head,Elemtype*elem,int aidelem_locate){
    if(aidelem_locate==1){
      LinkList p,q;
      q=Head->Next;
      *elem=q->Date;
      p=Head->Next->Next;
      Head->Next=p;
      free(q);
      return Head;
    }
    else if(aidelem_locate==Head->length){
      int i;
      LinkList q;
      for(q=Head->Next,i=1;i<aidelem_locate-1;q=q->Next,i++);
      *elem=q->Date;
        LinkList p=q->Next;
      q->Next=NULL;
      free(p);
      return Head;
    }
    else{
      int i;
      LinkList q;
      for(q=Head->Next,i=1;i<aidelem_locate-1;q=q->Next,i++);
      *elem=q->Date;
      q->Next=q->Next->Next;
      return Head;
    }
}

LinkList MergeList(LinkList&Head1,LinkList&Head2){
    LinkList pa,pb,pc,Merge;
    pa=Head1->Next;
    pb=Head2->Next;
    Merge=pc=Head1;
    while(pa&&pb){
        if(pa->Date<=pb->Date){
            pc->Next=pa;pc=pa;pa=pa->Next;
        }
        else{
            pc->Next=pb;pc=pb;pb=pb->Next;
        }
        pc->Next=pa?pa:pb;
        free(Head2);
    }
    return Merge;
}

void Printlist(LinkList Head){
    LinkList p;
    int flag;
    for(p=Head->Next,flag=1;p;p=p->Next,flag++){
        printf("%d	",p->Date);
        if(Head->length%5!=0&&flag%5==0)
            cout<<endl;
    }
    cout<<endl;
}
/****************************************
    Author:CRUEL_KING
    Time:2018/11/9
    Program name:带头结点的单链表基本操作的实现.cpp
****************************************/