思路:
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode *p = new ListNode(-1);
auto q = p;
while (l1 && l2) {
if (l1->val < l2->val) {
p->next = l1;
p = p->next;
l1 = l1->next;
}else {
p->next = l2;
p = p->next;
l2 = l2->next;
}
}
p->next = (l1 ? l1 : l2);
return q->next;
}
};