auto commit

docs/notes/Leetcode-Database 题解.md

@@ -497,7 +497,7 @@ https://leetcode.com/problems/customers-who-never-order/description/
 
 ## Description
 
-Curstomers 表：
+Customers 表：
 
 ```html
 +----+-------+

docs/notes/算法.md

@@ -443,7 +443,7 @@ public abstract class MergeSort<T extends Comparable<T>> extends Sort<T> {
             } else if (j > h) {
                 nums[k] = aux[i++];
 
-            } else if (aux[i].compareTo(nums[j]) <= 0) {
+            } else if (aux[i].compareTo(aux[j]) <= 0) {
                 nums[k] = aux[i++]; // 先进行这一步，保证稳定性
 
             } else {