Java iterative approach, easy to understand


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

Log in to reply
 

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