Java 16 ms Recursive approach


  • 0
    W

    Time = Complexity = > O(n+m)
    n = length of list1
    m = length of list2

     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if (l1 == null) return l2;
            if (l2 == null) 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.