题目:
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 *head=new ListNode(0);
ListNode *t=head;
while(l1!=NULL||l2!=NULL){
if(l1==NULL){
t->next=l2;
l2=l2->next;
}
else if(l2==NULL){
t->next=l1;
l1=l1->next;
}
else if(l1->val<l2->val){
t->next=l1;
l1=l1->next;
}
else{
t->next=l2;
l2=l2->next;
}
t=t->next;
}
return head->next;
}
};
精简版:
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1==NULL) return l2;
if(l2==NULL) return l1;
if(l1->val < l2->val){
l1->next=mergeTwoLists(l1->next,l2);
return l1;
}
else{
l2->next=mergeTwoLists(l1,l2->next);
return l2;
}
}
};