Java solution using fakeHead. O(n)


  • 0
    C
       public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            ListNode fakeHead = new ListNode(100);
            ListNode cur = fakeHead;
            while(l1!=null && l2!=null){
                if(l1.val<l2.val){
                    cur.next = l1;
                    l1 = l1.next;
                }else{
                    cur.next = l2;
                    l2=l2.next;
                }
                cur = cur.next;
            }
           if(l1!=null){
                cur.next = l1;
            }
           if(l2!=null){
                cur.next = l2;
            }
            return fakeHead.next;
        }

Log in to reply
 

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