diff --git a/README.md b/README.md index 81bd1e65..7fc70879 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,5 @@
-离线阅读版本下载 +离线阅读版本下载

diff --git a/notes/Leetcode 题解 - 二分查找.md b/notes/Leetcode 题解 - 二分查找.md index d5dd007b..d2c64f97 100644 --- a/notes/Leetcode 题解 - 二分查找.md +++ b/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 (Medium)](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 diff --git a/notes/Leetcode 题解 - 分治.md b/notes/Leetcode 题解 - 分治.md index cafb3a45..71df3d18 100644 --- a/notes/Leetcode 题解 - 分治.md +++ b/notes/Leetcode 题解 - 分治.md @@ -77,6 +77,9 @@ The above output corresponds to the 5 unique BST's shown below: ```java public List generateTrees(int n) { + if(n < 1){ + return new LinkedList(); + } return generateSubtrees(1, n); }