链表的建立排序及其归并

#include <stdio.h>
#include <stdlib.h>
using namespace std;

struct 
{
    int temp;
    struct  *next;
};

  链表的创建
*/
void CreateLinkList(LinkList *ptr)
{
    LinkList *pt = ptr;
    cout<<"please input six number:"<<endl;
    int index;
    int flag = 6;
    while(flag--)
    {
        cin>>index;
        LinkList *a = new LinkList;
        a->temp = index;
        pt->next = a;
        pt = a;
    }
    pt->next = NULL;
    LinkList *n = ptr->next;
}

 链表的排序
*/
LinkList* SortLinkList(LinkList *ptr)
{
    int mid;

    LinkList *m = ptr->next;
    LinkList *n;
    while(m->next!=NULL)
    {
        n = m->next;
        while(n!=NULL)
        {
            if(n->temp < m->temp)
            {
                mid = m->temp;
                m->temp = n->temp;
                n->temp = mid;
            }
            n = n->next;
        }
        m = m->next;
    }
    return ptr;
}

链表的归并
*/
LinkList* MergeLinkList(LinkList *a, LinkList *b)
{
    a = a->next;
    b = b->next;
    LinkList *ptc = new LinkList;
    LinkList *ptr = ptc;
    while(a!=NULL||b!=NULL)
    {
        LinkList *c = new LinkList;
        if(a==NULL)
        {
            c->temp = b->temp;
            b = b->next;
        }
        else if(b==NULL)
        {
            c->temp = a->temp;
            a = a->next;
        }
        else if(a->temp<=b->temp)
        {
            c->temp = a->temp;
            a = a->next;
        }
        else
        {
            c->temp = b->temp;
            b = b->next;
        }
        ptr->next = c;
        ptr = c;
    }
    ptr->next = NULL;
    return ptc;
}

插入归并
*/
LinkList *TryLinkList(LinkList *a,LinkList *b)
{
    LinkList *pta = a->next;
    LinkList *ptb = b->next;
    LinkList *ptr = b;
    while(pta!=NULL)
    {
        while(ptb!=NULL)
        {
            if(pta->temp<ptb->temp)
            {
                LinkList *n = new LinkList;
                n->temp = pta->temp;
                n->next = ptb;
                ptr->next = n;
                ptr = n;
                break;
            }
            ptr = ptb;
            ptb = ptb->next;
        }
        if(ptb==NULL && pta!=NULL)
        {
            ptr->next = pta;
            break;
        }
        else pta = pta->next;
    }
    cout<<"over!"<<endl;
    return b;
}
int main()
{
    LinkList *pta = new LinkList;
    LinkList *ptb = new LinkList;
    CreateLinkList(pta);
    CreateLinkList(ptb);
    pta = SortLinkList(pta);
    ptb = SortLinkList(ptb);
    LinkList *p = pta->next;
    cout<<"LA:";
    while(p!=NULL)
    {
        cout<<p->temp<<" ";
        p = p->next;
    }
    cout<<endl;
    cout<<"LB:";
    p = ptb->next;
    while(p!=NULL)
    {
        cout<<p->temp<<" ";
        p = p->next;
    }
    cout<<endl;

    //LinkList *ptc = MergeLinkList(pta,ptb);
    LinkList *ptc = TryLinkList(pta,ptb);
    ptc = ptc->next;
    cout<<"LC:";
    while(ptc!=NULL)
    {
        cout<<ptc->temp<<" ";
        ptc = ptc->next;
    }
    free(pta);
    free(ptb);
    free(ptc);
    return 0;
}