@@ -0,0 +1,579 @@
+/**%0A * Definition for singly-linked list.%0A * public class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int x) %7B val = x; %7D%0A * %7D%0A */%0A%0Apublic class Solution %7B%0A%0A    public ListNode mergeTwoLists(ListNode l1, ListNode l2) %7B%0A%0A        if (l1 == null) %7B%0A            return l2;%0A        %7D%0A%0A        if (l2 == null) %7B%0A            return l1;%0A        %7D%0A%0A        if (l1.val %3C l2.val) %7B%0A%0A            l1.next = mergeTwoLists(l1.next, l2);%0A            return l1;%0A%0A        %7D else %7B%0A%0A            l2.next = mergeTwoLists(l1, l2.next);%0A            return l2;%0A%0A        %7D%0A%0A    %7D%0A%0A%7D%0A

Create : 21 Merge Two Sorted Lists