[Accepted] My recursive solution


  • 0
    L
    class Solution {
    public:
        ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
    		if (l1 == nullptr)
    			return l2;
    		if (l2 == nullptr)
    			return l1;
    
    		if (l1->val > l2->val)
    			swap(l1, l2);
    
    		l1->next = mergeTwoLists(l1->next, l2);
    		return l1;
        }
    };

Log in to reply
 

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