algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新0034.在排序数组中查找元素的第一个和最后一个位置.md 疑似错别字

Browse Source
This commit is contained in:
zhuxianzhong
2021-12-26 10:01:41 +08:00
parent dac8367ddd
commit 854a8c6f90
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
View File

@ -50,7 +50,7 @@
采用二分法来去寻找左右边界，为了让代码清晰，我分别写两个二分来寻找左边界和右边界。
**刚刚接触二分搜索的同学不建议上来就像如果用一个二分来查找左右边界，很容易把自己绕进去，建议扎扎实实的写两个二分分别找左边界和右边界**
**刚刚接触二分搜索的同学不建议上来就想用一个二分来查找左右边界，很容易把自己绕进去，建议扎扎实实的写两个二分分别找左边界和右边界**
### 寻找右边界