合并两个有序链表

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

递归

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
    if(l1==nullptr)
        return l2;
    if(l2==nullptr)
        return l1;
    if(l1->val<l2->val)
    {
        l1->next=mergeTwoLists(l1->next,l2);
        return l1;
    }
    else
    {
        l2->next=mergeTwoLists(l1,l2->next);
        return l2;
    }
    }
};

递推

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(!l1)
            return l2;
        if(!l2)
            return l1;
        
        ListNode* res = new ListNode(0), * now = res;
        ListNode* node1 = l1, * node2 = l2;
        while(node1 && node2){
            if(node1->val > node2->val){
                now->next = node2;
                now = node2;
                node2 = node2->next;
            } else {
                now->next = node1;
                now = node1;
                node1 = node1->next;
            }
        }
        if(!node1)
            now->next = node2;
        else
            now->next = node1;
        
        now = res;
        res = res->next;
        delete now;
        return res;
    }
};