auto commit

docs/notes/Leetcode 题解 - 二分查找.md

@@ -257,7 +257,7 @@ public int findMin(int[] nums) {
 
 ## 6. 查找区间
 
-[34. Search for a Range (Medium)](https://leetcode.com/problems/search-for-a-range/description/)
+[34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)
 
 ```html
 Input: nums = [5,7,7,8,8,10], target = 8

docs/notes/Leetcode 题解 - 分治.md

@@ -77,6 +77,9 @@ The above output corresponds to the 5 unique BST's shown below:
 
 ```java
 public List<TreeNode> generateTrees(int n) {
+    if (n < 1) {
+        return new LinkedList<TreeNode>();
+    }
     return generateSubtrees(1, n);
 }
 

docs/notes/MySQL.md

@@ -324,7 +324,7 @@ MySQL 提供了两种相似的日期时间类型：DATETIME 和 TIMESTAMP。
 
 ### 1. DATETIME
 
-能够保存从 1001 年到 9999 年的日期和时间，精度为秒，使用 8 字节的存储空间。
+能够保存从 1000 年到 9999 年的日期和时间，精度为秒，使用 8 字节的存储空间。
 
 它与时区无关。
 

notes/Leetcode 题解 - 二分查找.md

@@ -257,7 +257,7 @@ public int findMin(int[] nums) {
 
 ## 6. 查找区间
 
-[34. Find First and Last Position of Element in Sorted Array (Medium)](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)
+[34. Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)
 
 ```html
 Input: nums = [5,7,7,8,8,10], target = 8

notes/Leetcode 题解 - 分治.md

@@ -77,7 +77,7 @@ The above output corresponds to the 5 unique BST's shown below:
 
 ```java
 public List<TreeNode> generateTrees(int n) {
-    if(n < 1){
+    if (n < 1) {
         return new LinkedList<TreeNode>();
     }
     return generateSubtrees(1, n);