AC recursive solution


  • 0
    U
    public class Solution {// using recursive;
    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= new ListNode(l1.val);
            head.next= mergeTwoLists(l1.next,l2);
        }
        else{
            head= new ListNode(l2.val);
            head.next= mergeTwoLists(l2.next,l1);
        }
        return head;
        
        
        
            
        
        
    }
    

    }


Log in to reply
 

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