StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix

Browse Source
This commit is contained in:
fighter 2019-05-11 19:45:39 +08:00
parent e2c271f270
commit 9226901705
2 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -257,7 +257,7 @@ public int findMin(int[] nums) {
## 6. 查找区间 ## 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 ```html
Input: nums = [5,7,7,8,8,10], target = 8 Input: nums = [5,7,7,8,8,10], target = 8

3
notes/Leetcode 题解 - 分治.md
View File

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