题目:
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
合并两个排序的链表,并返回一个新的链表。新链表应由两个链表拼接而成。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
{
//l1为空,则返回l2,l2为空,则返回l1
if (l1 == NULL) return l2;
if (l2 == NULL) return l1;
//q结点记录链表的起始结点
ListNode q(-1);
ListNode *p=&q;
//循环判断l1和l2大小,小的链接到p后,循环结束条件是l1和l2之间有一个先遍历完
while(l1 != NULL && l2 != NULL)
{
if(l1->val <= l2->val)
{
p->next = l1;
p = p->next;
l1 = l1->next;
}
else
{
p->next = l2;
p = p->next;
l2 = l2->next;
}
}
//如果l2先遍历完,把l1接到p后即可
if(l1)
{
p->next = l1;
}
if(l2)
{
p->next = l2;
}
//返回连接后链表的首结点,不是q,q不属于l1和l2,而是q->next
return q.next;
}
};
递归解法:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2)
{
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode *p = NULL;
if(l1->val < l2->val)
{
p = l1;
p->next = mergeTwoLists(l1->next , l2);
}
else
{
p = l2;
p->next = mergeTwoLists(l1 , l2->next);
}
return p;
}
};