leetcode21 合并两个有序链表

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

传统法子：

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode* tempHead = new ListNode(0);
        ListNode* tempNode = tempHead;
        while (l1 && l2) {
            if (l1 -> val < l2 -> val) {
                tempNode -> next = l1;
                l1 = l1 -> next;  
            }else {
                tempNode -> next = l2;
                l2 = l2 -> next;  
            }
            tempNode = tempNode -> next;
        }
        if (l1)  tempNode -> next = l1;
        if (l2)  tempNode -> next = l2;
        return tempHead -> next;
    }
};

递归法子！！！谨记

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