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.
AC代码如下:
/**
* 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;
else if(l2==NULL)
return l1;
ListNode* p;
ListNode* ret;//保存返回链表指针
if(l1->val<l2->val){
p=l1;
l1=l1->next;
}else{
p=l2;
l2=l2->next;
}
ret=p;
for(;l1!=NULL&&l2!=NULL;){
if(l1->val<l2->val){
p->next=l1;
l1=l1->next;
}
else{
p->next=l2;
l2=l2->next;
}
p=p->next;
}
if(l1!=NULL)
p->next=l1;
if(l2!=NULL)
p->next=l2;
return ret;
}
};