Simple Recursive Java Solution

  • 23
    public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        if(l1.val < l2.val){
   = mergeTwoLists(, l2);
            return l1;
   = mergeTwoLists(l1,;
            return l2;


  • 0

    It's simple and easy to read. thanks.

  • 0

    Glad it helped!

Log in to reply

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