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