@@ -0,0 +1,1620 @@
+package main;%0A%0Aimport problem.mergesort.*;%0Aimport datastructure.listnode.*;%0A%0Apublic class Main %7B%0A  public static void main(String%5B%5D args) %7B%0A%09// PROBLEM Merge-sort Linked List%0A    MergeSortLinkedList();%0A    %0A    // PROBLEM Two Sum%0A    TwoSum();%0A  %7D%0A  %0A  public static void MergeSortLinkedList() %7B%0A%09System.out.println(%22==============================%5Cn%22);%0A%09System.out.println(%22PROBLEM Merge-sort Linked List%5Cn%22);%0A%09System.out.println(%22==============================%5Cn%22);%0A%09%0A%09// Generate a sample input %5B4, 2, 5, 3, 6%5D%0A%09System.out.println(%22Generate a sample input %5B4, 2, 5, 3, 6%5D%5Cn%22);%0A    ListNode nodeFirst = new ListNode(4);%0A    ListNode nodeSecond = new ListNode(2);%0A    ListNode nodeThird = new ListNode(5);%0A    ListNode nodeFourth = new ListNode(3);%0A    ListNode nodeFifth = new ListNode(6);%0A    %0A    nodeFirst.next = nodeSecond;%0A    nodeSecond.next = nodeThird;%0A    nodeThird.next = nodeFourth;%0A    nodeFourth.next = nodeFifth;%0A    nodeFifth.next = null;%0A        %0A    // Merge sort the sample input%0A    nodeFirst = MergeSortLinkedList.mergeSortList(nodeFirst);%0A    %0A    // Print out result%0A    MergeSortLinkedList.printList(nodeFirst);%0A%09%0A%09System.out.println(%22%5Cn%5Cn%22);%0A  %7D%0A  %0A  public static void TwoSum() %7B%0A%09System.out.println(%22===============%5Cn%22);%0A%09System.out.println(%22PROBLEM Two Sum%5Cn%22);%0A%09System.out.println(%22===============%5Cn%22);%0A%09%0A%09// Generate a sample input%0A%09// numbers=%7B2, 7, 11, 15%7D, target=9%0A%09System.out.println(%22Generate a sample input%5Cn%22);%0A    System.out.println(%22numbers=%7B2, 7, 11, 15%7D, target=9%5Cn%22);%0A        %0A    // Merge sort the sample input%0A    %0A    // Print output%0A    %0A%09System.out.println(%22%5Cn%5Cn%22);%0A  %7D%0A%7D%0A

Create Main.java