题目:输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
//检验边界条件,保证程序的鲁棒性.
if(pHead1 == NULL) return pHead2;
if(pHead2 == NULL) return pHead1;
ListNode* new_head = NULL;
if(pHead1->val < pHead2->val){
new_head = pHead1;
new_head->next = Merge(pHead1->next,pHead2);//递归调用,每次返回一个较小数的指针,并加入到new_head所在的链表
}
else{
new_head = pHead2;
new_head->next = Merge(pHead2->next,pHead1);
}
return new_head;
}
};