题目:
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) {
ListNode* res=new ListNode(0);
ListNode* tmp=res;
while(l1!=NULL&&l2!=NULL){
if(l1->val>l2->val){
tmp->next=new ListNode(l2->val);
l2=l2->next;
tmp=tmp->next;
}
else if(l1->val<l2->val){
tmp->next=new ListNode(l1->val);
l1=l1->next;
tmp=tmp->next;
}
else if(l1->val==l2->val){
tmp->next=new ListNode(l1->val);
tmp=tmp->next;
tmp->next=new ListNode(l2->val);
tmp=tmp->next;
l1=l1->next;
l2=l2->next;
}
}
if(l1!=NULL){
tmp->next=l1;
}
if(l2!=NULL){
tmp->next=l2;
}
return res->next;
}
};