1.归并算法排序

exercises/liufq/中等/归并排序/Solution.java

@@ -5,6 +5,9 @@ class Solution {
         }
         int[] helper = new int[nums.length];
         mergeSort(nums, helper, 0, nums.length - 1);
+        for (int i = 0; i < helper.length; i++) {
+            System.out.println(helper[i]);
+        }
     }
 
     private static void mergeSort(int[] nums, int[] helper, int low, int high) {