[2023 King's Road Data Structure] [Linear Table—page40—13] Complete implementation of C and C++ (can be run directly)

~~~How can the writing style end in a dull way, and the story does not recognize ordinary at the beginning ✌✌✌

If you need the complete code, you can follow the public account below, and reply "code" in the background to get it. Aguang is looking forward to your visit~

Question:

Suppose there are two linear lists sorted in ascending order of element values, both stored in the form of singly linked lists, please write an algorithm to merge the two singly linked lists into one sorted in descending order of element values ​​but lose a streak, and ask to use The nodes of the original two singly linked lists store the merged singly linked list.

Problem solving ideas:

>归并排序

Code:

#include <iostream>
using namespace std;

typedef struct LNode
{
    int data;
    struct LNode *next;
} LNode, *LinkList;

// 头插法
void HeadInsert(LinkList &L)
{
    int val = 0;
    while (cin >> val)
    {
        LNode *s = new LNode;
        s->data = val;
        s->next = L->next;
        L->next = s;

        if (cin.get() == '\n')
        {
            break;
        }
    }
}

// 尾插法
void TailInsert(LinkList &L)
{
    int val = 0;
    LNode *r = L;
    while (cin >> val)
    {
        LNode *s = new LNode;
        s->data = val;
        r->next = s;
        r = s;
        r->next = NULL;

        if (cin.get() == '\n')
        {
            break;
        }
    }
}

// 遍历输出链表元素
void Print(LinkList L)
{
    LNode *p = L->next;
    while (p)
    {
        cout << p->data << '\t';
        p = p->next;
    }
    cout << endl;
}

void MergeList(LinkList &LA, LinkList &LB)
{
    LNode *pa, *pb, *r; //分别保存LA、LB工作指针和用于临时保存后继指针
    pa = LA->next;
    pb = LB->next;
    LA->next = NULL; //将LA置为空表

    while (pa && pb)
    {
        if (pa->data < pb->data)
        {
            r = pa->next;
            pa->next = LA->next;
            LA->next = pa;

            pa = r;
        }
        else
        {
            r = pb->next;
            pb->next = LA->next;
            LA->next = pb;

            pb = r;
        }
    }

    //将表中剩余元素依次插入
    while (pa)
    {
        r = pa->next;
        pa->next = LA->next;
        LA->next = pa;

        pa = r;
    }

    while (pb)
    {
        r = pb->next;
        pb->next = LA->next;
        LA->next = pb;

        pb = r;
    }

    delete LB;
}

int main()
{
    LinkList LA = new LNode;
    LinkList LB = new LNode;
    TailInsert(LA);
    TailInsert(LB);

    MergeList(LA, LB);

    Print(LA);
}