第7讲3*

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* merge(ListNode* l1, ListNode* l2) {
        auto dummy = new ListNode(-1), tail = dummy;  //创建虚拟头结点dummy
        while(l1 && l2)
        {
            if (l1->val < l2->val)
            {
                tail = tail->next = l1;  //下一个指向l1
                l1 = l1->next;  //删除l1 用过的那个
            }
            else
            {
                tail = tail->next = l2;
                l2 = l2->next;
            }
        }

        if(l1) tail->next = l1;  //最后还剩哪个哪个接上去
        if(l2) tail->next = l2;

        return dummy->next;
    }
};