/**
* 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* L = new ListNode(1);
ListNode* r = L;
while(l1 && l2){
if(l1->val <= l2->val){
r->next = l1;
r = r->next;
l1 = l1->next;
}
else{
r->next = l2;
r = r->next;
l2 = l2->next;
}
}
if(l1){
r->next = l1;
}
else if(l2){
r->next = l2;
}
L = L->next;
return L;
}
};