1.归并算法排序

8ef68061 · 漫长的~以后 · 613fadc6 · 8ef68061
显示空白变更内容
内联并排

Showing with 2 addition and 2 deletion

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

未找到文件。
--- a/exercises/liufq/中等/归并排序/Solution.java
+++ b/exercises/liufq/中等/归并排序/Solution.java
@@ -5,8 +5,8 @@ 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]);
+        for (int i = 0; i < nums.length; i++) {
+            System.out.println(nums[i]);
        }
    }