time O(m+n) space O(m+n)

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

Log in to reply

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