LeetCode-21.Merge Two Sorted Lists

LeetCode-21.Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

本题可以采用循环和递归两种解法， 首先比较l1和l2的val,若l1->val>=l2->val,则下一次比较l1->val与(l2->next)->val,若

l1->val<l2->val,则下一次比较(l1->next)->val与l2->val。若l1 == NULL，则返回l2,若l2 == NULL，则返回l1。

递归的解法为

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

采用循环的解法(LeetCode上的解答）如下

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