My java recursive solution


  • 13
    C
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if (l1==null) {
    			return l2;
    		}
    		if (l2==null) {
    			return l1;
    		}
    		if (l1.val <= l2.val) {
    			l1.next = mergeTwoLists(l1.next, l2);
    			return l1;
    		}else {
    			l2.next = mergeTwoLists(l1, l2.next);
    			return l2;
    			}
    		}

  • 0
    R

    Very simple and easy to understand.


Log in to reply
 

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