Leetcode-21：合并两个有序链表

个人思路总结

1、非递归实现：
对两个链表的最左端依次比较，小的先加入到输出链表中。然后依次遍历即可
2、递归实现：
和非递归思维差不多，只不过实现形式略有区别

代码如下：

1、非递归

/**
 * 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* result = new ListNode(0);
        ListNode* tmp = result;
        while(l1 && l2)
        {
            if(l1->val>l2->val)
            {
                tmp->next = l2;
                tmp = tmp->next;
                l2 = l2->next;
            }
            else
            {
                tmp->next = l1;
                tmp = tmp->next;
                l1 = l1->next;
            }
        }
        if(l1!=nullptr)
            tmp->next = l1;
        else
            tmp->next = l2;
        return result->next;
    }
};

2、递归

/**
 * 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* result = nullptr;
        if(l1==nullptr)
            return l2;
        else if(l2==nullptr)
            return l1;
        if(l1->val<l2->val)
        {
            result = l1;
            result->next = mergeTwoLists(l1->next,l2);
        }
        else
        {
            result = l2;
            result->next = mergeTwoLists(l1,l2->next);
        }
        return result;
    }
};