21. Merge Two Sorted Lists*
https://leetcode.com/problems/merge-two-sorted-lists/
题目描述
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
C++ 实现 1
题目不难, 另外, 链表的题一般设置一个虚拟节点 dummy
会省去很多麻烦.
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if (!l1 && !l2) return nullptr;
ListNode *dummy = new ListNode(0);
auto p = dummy;
while (l1 && l2) {
if (l1->val < l2->val) {
p->next = l1;
l1 = l1->next;
} else {
p->next = l2;
l2 = l2->next;
}
p = p->next;
}
p->next = l1 ? l1 : l2;
return dummy->next;
}
};