Merge 2 Sorted Lists (Iterative Solution)


  • 0
    L
                       class Solution {
        public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1==null && l2==null)return null;
        if(l1==null)return l2;
        if(l2==null)return l1;
        ListNode root=(l1.val<=l2.val)?l1:l2;
        if(root==l1)l1=l1.next;
        else
            l2=l2.next;
        ListNode temp=root;
        while(l1!=null && l2!=null){
            if(l1.val<=l2.val){
                temp.next=l1;
                l1=l1.next;
                temp=temp.next;
            }else{
                temp.next=l2;
                l2=l2.next;
                temp=temp.next;
            }
        }
        if(l1!=null){
            temp.next=l1;
        }
        if(l2!=null){
            temp.next=l2;
        }
        return root;
    }
    

    }


Log in to reply
 

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