My 5 lines JAVA recursive solution


  • 0
    C
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if (l1 == null) return l2;
            if (l2 == null) return l1;
            ListNode node = new ListNode(l1.val > l2.val ? l2.val : l1.val);
            node.next = (l1.val > l2.val ? mergeTwoLists(l1,l2.next) : mergeTwoLists(l1.next,l2));
            return node;
    }

Log in to reply
 

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