Merge branch 'master' of https://github.com/CyC2018/CS-Notes

README.md

@@ -1,5 +1,5 @@
 <div align="center">
-<a href="https://github.com/CyC2018/CS-Notes/blob/master/other/download.md">离线阅读版本下载</a>
+<a href="https://github.com/CyC2018/CS-Notes/blob/master/other/download.md"><strong>离线阅读版本下载</strong></a>
 </div>
 
 <br>

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

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);
 }