LeetCode21: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.
很经典的算法，这里贴出递归与非递归的解法。
非递归：

/**
 * 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) {
        if(!l1) return l2;
        if(!l2) return l1;
        ListNode *p=new ListNode(0), *cur=p;
        while(l1&&l2){
            if(l1->val<l2->val){cur->next=l1;l1=l1->next;}
            else {cur->next=l2;l2=l2->next;}
            cur=cur->next;
        }
        cur->next=l1?l1:l2;
        return p->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;
        }
    }
};