algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Remove the spaces between “ ” and 中文 aside.

Browse Source
This commit is contained in:
Yudong Jin
2022-12-21 01:37:58 +08:00
parent 7283bbaf6f
commit f3ef226874
31 changed files with 126 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/java/chapter_sorting/merge_sort.java
View File

@ -25,13 +25,13 @@ public class merge_sort {
int i = leftStart, j = rightStart;
// 通过覆盖原数组 nums 来合并左子数组和右子数组
for (int k = left; k <= right; k++) {
// 若 “左子数组已全部合并完”，则选取右子数组元素，并且 j++
// 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
if (i > leftEnd)
nums[k] = tmp[j++];
// 否则，若 “右子数组已全部合并完” 或 “左子数组元素 < 右子数组元素”，则选取左子数组元素，并且 i++
// 否则，若“右子数组已全部合并完”或“左子数组元素 < 右子数组元素”，则选取左子数组元素，并且 i++
else if (j > rightEnd || tmp[i] <= tmp[j])
nums[k] = tmp[i++];
// 否则，若 “左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
// 否则，若“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
else
nums[k] = tmp[j++];
}