思路:
新建一个头结点, 然后很简单的逻辑重新连接链表即可, 注意有一个链表遍历完以后就不用继续遍历另一个了, 直接衔接上然后跳出循环即可, 时间复杂度O(min(m, n)).
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* helper = new ListNode(0);
ListNode* saveHelper = helper;
while (l1 || l2) {
if (! l1) {
helper->next = l2;
break;
}
if (! l2) {
helper->next = l1;
break;
}
if (l1->val < l2->val)
helper->next = l1, l1 = l1->next;
else
helper->next = l2, l2 = l2->next;
helper = helper->next;
}
ListNode* head = saveHelper->next;
delete saveHelper;
return head;
}