21.合并两个有序链表
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有结点组成的。
示例:
输入:1 -> 2 -> 4 , 1 -> 3 -> 4
输出:1 -> 1 -> 2 -> 3 -> 4 -> 4
来源:力扣(LeetCode)
链接:link
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
C++源码:
/**
* 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* L1 = l1;
ListNode* L2 = l2;
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode* List = new ListNode(0);
ListNode* L3 = List;
while(L1 && L2)
{
ListNode* temp = new ListNode(0);
if(L1->val > L2->val)
{
temp->val = L2->val;
L3->next = temp;
L3 = temp;
L2 = L2->next;
continue;
}
if(L1->val < L2->val)
{
temp->val = L1->val;
L3->next = temp;
L3 = temp;
L1 = L1->next;
continue;
}
if(L1->val == L2->val)
{
temp->val = L1->val;
ListNode* temp1 = new ListNode(0);
temp1->val = L2->val;
L3->next = temp;
temp->next = temp1;
L3 = temp1;
L1 = L1->next;
L2 = L2->next;
continue;
}
}
while(L1)
{
ListNode* temp = new ListNode(0);
temp->val = L1->val;
L3->next = temp;
L3 = temp;
L1 = L1->next;
}
while(L2)
{
ListNode* temp = new ListNode(0);
temp->val = L2->val;
L3->next = temp;
L3 = temp;
L2 = L2->next;
}
return List->next;
}
};