[leetcode] Merge Two Sorted Lists

最新推荐文章于 2025-04-27 14:03:08 发布

原创最新推荐文章于 2025-04-27 14:03:08 发布 · 309 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍如何使用C++编程语言将两个已排序的链表合并为一个有序链表，通过创建虚拟头节点并迭代比较两个链表的元素进行合并。

From : https://leetcode.com/problems/merge-two-sorted-lists/

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) {
        ListNode *p=new ListNode(0);
        ListNode *head=p;
        while(l1 && l2) {
            if(l1->val<l2->val) p->next=l1,l1=l1->next;
            else p->next=l2,l2=l2->next;
            p=p->next;
        }
        if(l1) p->next=l1;
        if(l2) p->next=l2;
        return head->next;
    }
};