package com.fishercoder.solutions;

import com.fishercoder.common.classes.ListNode;

/**Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.*/
public class _21 {

    //credit: https://discuss.leetcode.com/topic/45002/java-1-ms-4-lines-codes-using-recursion
    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;
        }
    }

}

@@ -81,16 +81,50 @@
 de;%0A%0A/**
+%0A * 21. Merge Two Sorted Lists%0A * 
 Merge tw
@@ -173,16 +173,19 @@
 ew list.
+%0A *
  The new
@@ -262,16 +262,17 @@
 ists.*/%0A
+%0A
 public c
@@ -287,103 +287,8 @@
  %7B%0A%0A
-    //credit: https://discuss.leetcode.com/topic/45002/java-1-ms-4-lines-codes-using-recursion%0A
     

edit 21