方法一:正常思路 可以理解为双指针?
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
//伪头节点
ListNode *res = new ListNode(0), *p = res;
while(l1 && l2 ){
l1->val < l2->val ? (p->next = l1,l1 = l1->next) : (p->next = l2, l2 = l2->next);
p = p->next;
}
p->next = l1 ? l1 : l2;
return res->next;
}
};
方法二:递归方法
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1==nullptr) return l2;
if(l2==nullptr) return l1;
if(l1->val<l2->val){
l1->next = mergeTwoLists(l1->next, l2);
return l1;
}else{
l2->next = mergeTwoLists(l1, l2->next);
return l2;
}
}
};