/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
ListNode* head=new ListNode(1);
ListNode* cur=head;
while(pHead1&&pHead2){
if(pHead1->val<=pHead2->val){
cur->next=pHead1;
pHead1=pHead1->next;
}
else{
cur->next=pHead2;
pHead2=pHead2->next;
}
cur=cur->next;
}
if(pHead1==nullptr)
cur->next=pHead2;
else
cur->next=pHead1;
return head->next;
}
};
合并两个有序单链表
最新推荐文章于 2021-11-22 09:17:24 发布