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 Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* head=new ListNode(0);
ListNode* now=head;
while(l1&&l2){
now->next=new ListNode(0);
if(l1->val<l2->val){
now->next->val=l1->val;
l1=l1->next;
}
else{
now->next->val=l2->val;
l2=l2->next;
}
now=now->next;
}
if(l2){
l1=l2;
}
now->next=l1;
return head->next;
}
};