leetcode 21 Merge Two Sorted Lists

标签：pre   code   node   class   val   tco   public   else   sorted   

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;
        }
    }
};

leetcode 21 Merge Two Sorted Lists

标签：pre   code   node   class   val   tco   public   else   sorted   

原文地址：http://www.cnblogs.com/wangkun1993/p/6388150.html