将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
--------------------------------------------------------------------------------------------------------
/**
* 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 && !l2) return nullptr;
ListNode *new_Node = new ListNode(-1);
ListNode *bp = new_Node;
while (l1 && l2)
{
if (l1->val <=l2->val)
{
bp->next = l1;
l1 = l1->next;
}
else
{
bp->next = l2;
l2 = l2->next;
}
bp = bp->next;
}
if (!l1)
{
bp->next = l2;
bp = bp->next;
}
if (!l2)
{
bp->next = l1;
bp = bp->next;
}
return new_Node->next;
}
};