Skip to content

增加C++二分模板 #477

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jan 11, 2021
Merged

增加C++二分模板 #477

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7bf67d8
增加C++二分模板
xybh-l Jan 11, 2021
8417aee
更新二分实现（最左最右）
xybh-l Jan 11, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
增加C++二分模板
  • Loading branch information
@xybh-l
xybh-l authored Jan 11, 2021
commit 7bf67d88d652fbcab267d755a5c59eb6a69dbd92
18 changes: 16 additions & 2 deletions 91/binary-search.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -157,10 +157,24 @@ function binarySearch(nums, target) {

##### C++

暂时空缺，欢迎 [PR](https://github.com/leetcode-pp/leetcode-cheat/pulls)

```cpp
int binarySearch(vector<int>& nums, int target){
if(nums.size() == 0)
return -1;

int left = 0, right = nums.size() - 1;
while(left <= right){
int mid = left + ((right - left) >> 1);
if(nums[mid] == target){ return mid; }
// 搜索区间变为 [mid+1, right]
else if(nums[mid] < target)
left = mid + 1;
// 搜索区间变为 [left, mid - 1]
else
right = mid - 1;
}
return -1;
}
```
### 寻找最左边的满足条件的值
Expand Down