题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
思路1:递归
首先比较俩链表头,小的那个作为新链表的头,新链表的头指向的就是剩下链表合并的结果,使用递归
/*
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;
if(pHead1->val <= pHead2->val){
pHead1->next = Merge(pHead1->next,pHead2);
return pHead1;
}else{//if(pHead1->val > pHead2->val)
pHead2->next = Merge(pHead2->next,pHead1);
return pHead2;
}
}
};
思路2:非递归
借助一个移动的指针
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
// 12
// 34
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
if(pHead1 == NULL) return pHead2;
if(pHead2 == NULL) return pHead1;
ListNode* res = NULL;//作为结果链表
ListNode* p;//作为在结果链表上跑的移动指针,在动态过程中永远指向链表尾
while((pHead1 != NULL) && (pHead2 != NULL)){
if(pHead1->val <= pHead2->val){
if(res == NULL){
p = res = pHead1;
}else{
p->next = pHead1;//结果链表加进新成员
p = p->next;//更新尾指针
}
pHead1 = pHead1->next;//更新链表1的头,旧头已经被放进新链表了
}else{
if(res == NULL){
p = res = pHead2;
}else{
p->next = pHead2;
p = p->next;
}
pHead2 = pHead2->next;
}
}
if(pHead1 == NULL)//链表1的结点已经加完,剩下链表2的残链,新链要加上
p->next = pHead2;
if(pHead2 == NULL)
p->next = pHead1;
return res;
}
};