class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
if(pHead1 == NULL || pHead2 == NULL)
return pHead1 != NULL ? pHead1 : pHead2;
ListNode* tmp = new ListNode(0);
ListNode* newp =tmp;
while(pHead1 && pHead2){
if(pHead1->val < pHead2->val){
tmp->next = pHead1;
pHead1 = pHead1->next;
}
else{
tmp->next = pHead2;
pHead2 = pHead2->next;
}
tmp = tmp->next;
if(pHead1)
tmp->next = pHead1;
if(pHead2)
tmp->next = pHead2;
}
newp = newp->next;
return newp;
}
};
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
if(pHead1 == NULL || pHead2 == NULL)
return pHead1 != NULL ? pHead1 : pHead2;
if(pHead1->val < pHead2->val){
pHead1->next = Merge(pHead1->next, pHead2);
return pHead1;
}
else{
pHead2->next = Merge(pHead1, pHead2->next);
return pHead2;
}
}
};
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
if(pHead1 == NULL || pHead2 == NULL)
return pHead1 != NULL ? pHead1 : pHead2;
ListNode* res = NULL;
if(pHead1->val < pHead2->val){
res = pHead1;
res->next = Merge(pHead1->next, pHead2) ;
}
else{
res = pHead2;
res->next = Merge(pHead1, pHead2->next);
}
return res;
}
};