LeetCode21- 合并两个有序链表

1.题目描述

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

 

2.解题思路

• 寻找新链表的头结点

ListNode* head = nullptr;
if(l1->val <= l2->val)
{
    head = l1;
    l1 = l1->next;
}
else
{
    head = l2;
    l2 = l2->next;
}

•  

• 

• 比较大小，合并链表。  

 

 

 

 

 

 

3.代码实现

/**
 * 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 == nullptr && l2 == nullptr)
            return nullptr;        
        if(l1 == nullptr)
            return l2;        
        if(l2 == nullptr)
            return l1;
        
        ListNode* head = nullptr;
        if(l1->val <= l2->val)
        {
            head = l1;
            l1 = l1->next;
        }
        else
        {
            head = l2;
            l2 = l2->next;
        }
        
        ListNode* cur = head;
        while(l1 || l2)
        {
            if(l1 == nullptr)
            {
                cur->next = l2;
                break;
            }
            
            else if(l2 == nullptr)
            {
                cur->next = l1;
                break;
            }
            
            ListNode* t = nullptr;
            if(l1->val == l2->val)
            {
                t = l1->next;
                cur->next = l1;
                l1 = t;
                cur = cur->next;
                t = l2->next;
                cur->next = l2;
                l2 = t;             
            }
            
            else if(l1->val < l2->val)
            {
                t = l1->next;
                cur->next = l1;
                l1 = t;
            }
            else
            {
                t = l2->next;
                cur->next = l2;
                l2 = t;
            }
            cur = cur->next;                     
        }
        return head;
    }
};