题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
非递归代码:
/*
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* pre_head = new ListNode(0);
ListNode* pTemp = pre_head;
while(pHead1 !=NULL && pHead2 != NULL){
if(pHead1->val < pHead2->val){
pTemp->next = pHead1;
pHead1 = pHead1->next;
}
else{
pTemp->next = pHead2;
pHead2 = pHead2->next;
}
pTemp = pTemp->next;
}
//将比较后某一个原始链表剩余部分直接插到新的链表后方
if(pHead1)
pTemp->next = pHead1;
if(pHead2)
pTemp->next = pHead2;
ListNode* ans = pre_head->next;
delete pre_head;
return ans;
}
};