Merge two sorted lists using recursion.


  • 0
    T
    /**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode(int x) { val = x; }
     * }
     */
    class Solution {
        public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            
            if(l1 == null){
                return l2;
            }
            if(l2 == null){
                return l1;
            }
    
            if(l1.val < l2.val){
                ListNode temp=l1.next;
                l1.next=l2;
                l1.next = mergeTwoLists(temp,l2);
                return l1;
            }else{
                ListNode temp=l2.next;
                l2.next=l1;
                l2.next = mergeTwoLists(l1,temp);
                return l2;
            }
            
            
        }
    }
    
    

Log in to reply
 

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