auto commit

407fe97b · CyC2018 · e168ca8d · 407fe97b · 407fe97b
隐藏空白更改
内联并排

Showing with 4 addition and 4 deletion

docs/notes/剑指 Offer 题解 - 50~59.md docs/notes/剑指 Offer 题解 - 50~59.md +2 -2

notes/剑指 Offer 题解 - 50~59.md notes/剑指 Offer 题解 - 50~59.md +2 -2

未找到文件。
--- a/docs/notes/剑指 Offer 题解 - 50~59.md
+++ b/docs/notes/剑指 Offer 题解 - 50~59.md
@@ -101,11 +101,11 @@ private void merge(int[] nums, int l, int m, int h) {
            tmp[k] = nums[j++];
        else if (j > h)
            tmp[k] = nums[i++];
-        else if (nums[i] < nums[j])
+        else if (nums[i] <= nums[j])
            tmp[k] = nums[i++];
        else {
            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++;
    }

--- a/notes/剑指 Offer 题解 - 50~59.md
+++ b/notes/剑指 Offer 题解 - 50~59.md
@@ -101,11 +101,11 @@ private void merge(int[] nums, int l, int m, int h) {
            tmp[k] = nums[j++];
        else if (j > h)
            tmp[k] = nums[i++];
-        else if (nums[i] < nums[j])
+        else if (nums[i] <= nums[j])
            tmp[k] = nums[i++];
        else {
            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++;
    }