algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-10 21:40:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2019-05-17 22:26:23 +08:00
parent e168ca8dae
commit 407fe97b21
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/notes/剑指 Offer 题解 - 50~59.md
View File

@ -101,11 +101,11 @@ private void merge(int[] nums, int l, int m, int h) {
tmp[k] = nums[j++]; tmp[k] = nums[j++];
else if (j > h) else if (j > h)
tmp[k] = nums[i++]; tmp[k] = nums[i++];
else if (nums[i] < nums[j]) else if (nums[i] <= nums[j])
tmp[k] = nums[i++]; tmp[k] = nums[i++];
else { else {
tmp[k] = nums[j++]; tmp[k] = nums[j++];
this.cnt += m - i + 1; // nums[i] >= nums[j]，说明 nums[i...mid] 都大于 nums[j] this.cnt += m - i + 1; // nums[i] > nums[j]，说明 nums[i...mid] 都大于 nums[j]
} }
k++; k++;
} }

4
notes/剑指 Offer 题解 - 50~59.md
View File

@ -101,11 +101,11 @@ private void merge(int[] nums, int l, int m, int h) {
tmp[k] = nums[j++]; tmp[k] = nums[j++];
else if (j > h) else if (j > h)
tmp[k] = nums[i++]; tmp[k] = nums[i++];
else if (nums[i] < nums[j]) else if (nums[i] <= nums[j])
tmp[k] = nums[i++]; tmp[k] = nums[i++];
else { else {
tmp[k] = nums[j++]; tmp[k] = nums[j++];
this.cnt += m - i + 1; // nums[i] >= nums[j]，说明 nums[i...mid] 都大于 nums[j] this.cnt += m - i + 1; // nums[i] > nums[j]，说明 nums[i...mid] 都大于 nums[j]
} }
k++; k++;
} }