题目描述:
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.
此题可以直接模拟归并排序的步骤,但是要小心指针为空的情况。
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* result=new ListNode(0);
ListNode* head=result;
if(l1==NULL&&l2==NULL) return NULL;
while(l1!=NULL||l2!=NULL)
{
ListNode* temp=new ListNode(0);
if(l1==NULL&&l2!=NULL)
{
temp->val=l2->val;
result->next=temp;
result=result->next;
l2=l2->next;
}
else if(l1!=NULL&&l2==NULL)
{
temp->val=l1->val;
result->next=temp;
result=result->next;
l1=l1->next;
}
else if(l1->val>l2->val)
{
temp->val=l2->val;
result->next=temp;
result=result->next;
l2=l2->next;
}
else
{
temp->val=l1->val;
result->next=temp;
result=result->next;
l1=l1->next;
}
}
return head->next;
}
};
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* head=new ListNode(0);
if(l1==NULL&&l2==NULL) return NULL;
if(l1!=NULL&&l2==NULL) head=l1;
else if(l1==NULL&&l2!=NULL) head=l2;
else if(l1!=NULL&&l2!=NULL)
{
if(l1->val>l2->val)
{
head->val=l2->val;
head->next=mergeTwoLists(l1,l2->next);
}
else
{
head->val=l1->val;
head->next=mergeTwoLists(l1->next,l2);
}
}
return head;
}
};