题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
解:两个链表合成一个链表,保持单调不减,可以建立两个指针指向两个链表遍历比较大小,再建立一个指针用来指向合并后的链表。具体实现如下:
/*
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 *p = pHead1, *q = pHead2, *r = NULL,*pHead = NULL;
if(p -> val > q -> val)
{
r = q;
q = q -> next;
}
else
{
r = p;
p = p -> next;
}
pHead = r;
while(p != NULL && q != NULL)
{
if(p -> val > q -> val)
{
r -> next = q;
r = q;
q = q -> next;
}
else
{
r -> next = p;
r = p;
p = p -> next;
}
}
if(q != NULL)
r -> next = q;
if(p != NULL)
r -> next = p;
return pHead;
}
};