输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
if(NULL == pHead1)
return pHead2;
if(NULL == pHead2)
return pHead1;
ListNode* pHead = NULL;
if(pHead1->val < pHead2->val)
{
pHead = pHead1;
pHead->next = Merge(pHead1->next,pHead2);
}
else if(pHead1->val >= pHead2->val)
{
pHead = pHead2;
pHead->next = Merge(pHead1,pHead2->next);
}
return pHead;
}
};