/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* ans=new ListNode(-1, NULL);
ListNode* p=ans;
while (l1!=NULL && l2!=NULL){
if (l1->val<l2->val){
p->next=l1;
l1=l1->next;
}
else{
p->next=l2;
l2=l2->next;
}
p=p->next;
p->next=NULL;
}
if (l1!=NULL) p->next=l1;
if (l2!=NULL) p->next=l2;
return ans->next;
}
};
LeetCode21. 合并两个有序链表
最新推荐文章于 2024-09-21 10:02:17 发布