合并两个有序链表

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

方法一：递归法

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) 
{
    if(l1 == NULL)
        return l2;
    else if(l2 == NULL)
        return l1;
    else if(l1->val < l2->val) 
    {
        l1->next = mergeTwoLists(l1->next, l2);
        return l1;
    }
    else 
    {
        l2->next = mergeTwoLists(l1, l2->next);
        return l2;
    }
}

方法二：迭代法

ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
{
    ListNode *result = new ListNode(-1);
    ListNode *workNode = result;
    while(l1 != NULL && l2 != NULL)
    {
        if(l1->val <= l2->val)
        {
            workNode->next = l1;
            l1 = l1->next;
        }
        else
        {
            workNode->next = l2;
            l2 = l2->next;
        }
        workNode = workNode->next;
    }
    workNode->next = l1 != nullptr ? l1 : l2;

    return result->next;
}