输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
类似于合并两个排序数组,但是数组合并是从后往前,链表遍历只能从前往后。大体方法不变
代码如下
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2){
ListNode* res=new ListNode(0);
ListNode* newhead=res;
if(pHead1 == NULL) return pHead2;
if(pHead2 == NULL) return pHead1;
while(pHead1!=NULL && pHead2!=NULL){
if(pHead1->val>pHead2->val){
res->next=pHead2;
pHead2=pHead2->next;
}
else{
res->next=pHead1;
pHead1=pHead1->next;
}
res=res->next;
}
if(pHead1==NULL) res->next=pHead2;
if(pHead2==NULL) res->next=pHead1;
return newhead->next;
}
};