21. Merge Two Sorted Lists
(Easy)
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.
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
链表结构:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class S
- 核心思想:
归并两个链表
注意空链表的情况
代码:
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1 == NULL)
return l2;
if(l2 == NULL)
return l1;
ListNode* start;
if(l1->val < l2->val)
{
start = l1;
l1 = l1->next;
}
else
{
start = l2;
l2 = l2->next;
}
ListNode* end = start;
while(l1 != NULL && l2 != NULL)
{
if(l1->val < l2->val)
{
end->next = l1;
end = end->next;
l1=l1->next;
}
else
{
end->next = l2;
end = end->next;
l2=l2->next;
}
}
while(l1 != NULL)
{
end->next = l1;
end = end->next;
l1=l1->next;
}
while(l2 != NULL)
{
end->next = l2;
end = end->next;
l2=l2->next;
}
return start;
}
};