实现合并两个有序链表

fuzhenwen

已于 2024-03-18 10:59:57 修改

阅读量296

点赞数 9

文章标签：链表前端 c++

于 2024-03-18 10:55:43 首次发布

本文链接：https://blog.csdn.net/fuzhenwen/article/details/136802980

版权

void MargeLinkList(Node *L1,Node *L2){
    Node *pa = L1->next,*pb = L2->next;
    Node *pc = L1;
    while(pa && pb){
        if(pa->data < pb->data) {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        } else if (pa->data > pb->data) {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        } else {
            pc->next = pa;
            pc = pa;
            pa = pa->next;
            pb = pb->next;
        }
    }
    if(pa)
        pc->next = pa;
    else
        pc->next = pb;
}