class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if(!l1)return l2;
if(!l2)return l1;
ListNode*head=new ListNode(-1);
ListNode*p=head;
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;
}
if(l1)p->next=l1;
if(l2)p->next=l2;
return head->next;
}
};
https://leetcode-cn.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/merge-two-sorted-lists/desc...
https://leetcode.com/problems/merge-two-sorted-lists/disc...
https://leetcode.com/problems/merge-two-sorted-lists/desc...
https://leetcode.com/problems/merge-two-sorted-lists/?tab...
https://leetcode.com/problems/merge-two-sorted-lists/desc...
https://leetcode.com/problems/merge-two-sorted-lists/#/de...
算法 merge-two-sorted-lists 解决办法： 递归 解决方法：backtracking solu...
本文标题：merge-two-sorted-lists
本文链接：https://www.haomeiwen.com/subject/ywfzqctx.html
网友评论