LeetCode 21. Merge Two Sorted Lists

最新推荐文章于 2024-04-03 21:24:25 发布

柳婼

最新推荐文章于 2024-04-03 21:24:25 发布

阅读量339

点赞数

CC 4.0 BY-SA版权

文章标签： LeetCode

本文链接：https://blog.csdn.net/liuchuo/article/details/51994005

LeetCode 专栏收录该内容

350 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并成一个新排序链表的方法。通过比较两个链表节点的值来决定新链表的节点顺序，并通过指针操作实现链表的拼接。最终返回合并后的新链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

21. Merge Two Sorted Lists
My Submissions QuestionEditorial Solution
Total Accepted: 120589 Total Submissions: 342161 Difficulty: Easy
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(l1 != NULL && l2 != NULL) {
            ListNode *p = l1;
            ListNode *q = l2;
            ListNode *t, *h;//t为新链表的连接指针，h为新链表的头指针
            if(p->val > q->val) {
                t = q;
                h = q;
                q = q->next;
            } else {
                t = p;
                h = p;
                p = p->next;
            }
            while(p != NULL && q != NULL) {
                if(p->val > q->val) {
                    t->next = q;
                    t = t->next;
                    q = q->next;
                } else {
                    t->next = p;
                    t = t->next;
                    p = p->next;
                }
                
            }
            while(p != NULL && q == NULL) {
                t->next = p;
                p = p->next;
                t = t->next;
            }
            while(p == NULL && q != NULL) {
                t->next = q;
                q = q->next;
                t = t->next;
            }
            while(p == NULL && q == NULL) {
                return h;
            }
        }
        if(l1 == NULL && l2 != NULL) {
            return l2;
        }
        if(l1 != NULL && l2 == NULL) {
            return l1;
        }
        if(l1 == NULL && l2 == NULL) {
            return NULL;
        }
    }
};