提交 8ef68061 编写于 作者: 漫长的~以后's avatar 漫长的~以后

1.归并算法排序

上级 613fadc6
...@@ -5,8 +5,8 @@ class Solution { ...@@ -5,8 +5,8 @@ class Solution {
} }
int[] helper = new int[nums.length]; int[] helper = new int[nums.length];
mergeSort(nums, helper, 0, nums.length - 1); mergeSort(nums, helper, 0, nums.length - 1);
for (int i = 0; i < helper.length; i++) { for (int i = 0; i < nums.length; i++) {
System.out.println(helper[i]); System.out.println(nums[i]);
} }
} }
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册