ehlxr/algorithm-base
1
0
Fork 0
mirror of https://github.com/chefyuan/algorithm-base.git synced 2024-12-27 12:56:17 +00:00
Code Issues Projects Releases Wiki Activity

add erfen in go

Browse Source
This commit is contained in:
lincongcong 2021-07-20 23:57:06 +08:00
parent a177043d3f
commit 02aaf283e1
1 changed files with 40 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
animation-simulation/二分查找及其变种/找出第一个大于或小于目标的索引.md
View File

@ -76,25 +76,49 @@ public static int lowBoundnum(int[] nums,int target,int left, int right) {
```java ```java
public static int upperBoundnum(int[] nums,int target,int left, int right) { public static int upperBoundnum(int[] nums,int target,int left, int right) {
while (left <= right) { while (left <= right) {
int mid = left + ((right - left) >> 1); int mid = left + ((right - left) >> 1);
//小于目标值 //小于目标值
if (nums[mid] < target) { if (nums[mid] < target) {
//看看是不是当前区间的最后一位，如果当前小于，后面一位大于，返回当前值即可 //看看是不是当前区间的最后一位，如果当前小于，后面一位大于，返回当前值即可
if (mid == right || nums[mid+1] >= target) { if (mid == right || nums[mid+1] >= target) {
return mid; return mid;
}
else{
left = mid + 1;
}
} else if (nums[mid] >= target){
right = mid - 1;
} }
else{
left = mid + 1;
}
} else if (nums[mid] >= target){
right = mid - 1;
} }
//没有查询到的情况
return -1;
} }
//没有查询到的情况
return -1;
}
``` ```
Go Code:
```go
func upperBoundnum(nums []int, target, left, right int) int {
for left <= right {
mid := left + ((right - left) >> 1)
//小于目标值
if nums[mid] < target {
//看看是不是当前区间的最后一位，如果当前小于，后面一位大于，返回当前值即可
if mid == right || nums[mid+1] >= target {
return mid
} else {
left = mid + 1
}
} else if nums[mid] >= target {
right = mid - 1
}
}
//没有查询到的情况
return -1
}
```