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