8ms C++ simple recursion


  • 9
    H
    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(l2->next,l1); return l2; }
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.