@@ -0,0 +1,1026 @@
+/**%0A * Problem: https://leetcode.com/problems/merge-two-sorted-lists/%0A * %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 */%0Apublic class Solution %7B%0A    public ListNode mergeTwoLists(ListNode l1, ListNode l2) %7B%0A        ListNode root = new ListNode(0);%0A        ListNode next = root;%0A        while(l1 != null %7C%7C l2 != null) %7B%0A            if(l1 != null && l2 != null) %7B%0A                if(l1.val %3C l2.val) %7B%0A                    next.next = new ListNode(l1.val);%0A                    l1 = l1.next;%0A                %7D else %7B%0A                    next.next = new ListNode(l2.val);%0A                    l2 = l2.next;%0A                %7D%0A            %7D else if(l1 != null) %7B%0A                next.next = new ListNode(l1.val);%0A                l1 = l1.next;%0A            %7D else %7B%0A                next.next = new ListNode(l2.val);%0A                l2 = l2.next;%0A            %7D%0A            next = next.next;%0A        %7D%0A        return root.next;%0A    %7D%0A%7D%0A

Create Merge_Two_Sorted_Lists.java