Java Solution using Recursion (Lists modified)


  • 0
    G
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if (l1==null) {
                return l2;
            }
            if (l2==null) {
                return l1;
            }
            ListNode head;
            if (l1.val <= l2.val) {
                head = l1;
                l1 = l1.next;
            } else {
                head = l2;
                l2 = l2.next;
            }
            head.next = mergeTwoLists(l1, l2);
            return head;
        }

Log in to reply
 

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