class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode *lp=NULL;
if(l1->val < l2->val){
lp = l1;
lp->next = mergeTwoLists(l1->next, l2);
}
else{
lp = l2;
lp->next = mergeTwoLists(l1, l2->next);
}
return lp;
}
};
leetcode-21-merge two sorted lists
最新推荐文章于 2022-08-19 20:42:09 发布