php合并两个有序链表,合并两个排序的链表

//做题目的时候还是要训练到位，建议先自己想，并且同时实现递归和非递归版本

//面试的时候一般都会考察。

class Solution {

public:

ListNode* Merge(ListNode* pHead1, ListNode* pHead2)

{

ListNode* result = NULL;

ListNode* current = NULL;

if(pHead1 == NULL)

return pHead2;

if(pHead2 == NULL)

return pHead1;

/*

if(pHead1->val <= pHead2->val){

result = pHead1;

result->next = Merge(pHead1->next, pHead2);

} else {

result = pHead2;

result->next = Merge(pHead1, pHead2->next);

}

*/

while(pHead1 != NULL && pHead2 != NULL){

if(pHead1->val <= pHead2->val){

if(result == NULL){

current = result = pHead1;

} else {

current->next = pHead1;

current = current->next;

}

pHead1 = pHead1->next;

} else {

if(result == NULL){

current = result = pHead2;

} else {

current->next = pHead2;

current = current->next;

}

pHead2 = pHead2->next;

}

}

if(pHead1 == NULL){

current->next = pHead2;

}

if(pHead2 == NULL){

current->next = pHead1;

}

return result;

}

};