题目
将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
//cpp
class Solution {
public:
ListNode* mergeTwoLists(ListNode* n1, ListNode* n2) {
ListNode dummy (0) ;
ListNode* start= &dummy ;
while(n1 && n2)
{
if(n1->val <= n2->val)
{
start->next = n1;
n1 = n1->next;
}
else
{
start->next = n2;
n2 = n2->next;
}
start = start->next;
}
start->next = n1 ? n1 : n2 ; //剩余部分的加入
return dummy.next;
}
};
#python
class Solution:
def mergeTwoLists(self, l1, l2):
if l1 is None:
return l2
elif l2 is None:
return l1
elif l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1, l2.next)
return l2