mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:22:55 +08:00
Update 0704.二分查找.md
增加了C语言版本的左闭右开区间版本
This commit is contained in:
@ -515,7 +515,8 @@ impl Solution {
|
||||
```
|
||||
|
||||
**C:**
|
||||
```c(版本一)
|
||||
```
|
||||
//C (版本一) 左闭右闭区间 [left, right]
|
||||
int search(int* nums, int numsSize, int target){
|
||||
int left = 0;
|
||||
int right = numsSize-1;
|
||||
@ -542,13 +543,13 @@ int search(int* nums, int numsSize, int target){
|
||||
}
|
||||
```
|
||||
```
|
||||
C (版本二)
|
||||
C (版本二) 左闭右开区间 [left, right)
|
||||
int search(int* nums, int numsSize, int target){
|
||||
int length = numsSize;
|
||||
int left = 0;
|
||||
int right = length;//定义target在左闭右开的区间里,即:[left, right)
|
||||
int right = length; //定义target在左闭右开的区间里,即:[left, right)
|
||||
int middle = 0;
|
||||
while(left < right){// left == right时,区间[left, right)属于空集,所以用 < 避免该情况
|
||||
while(left < right){ // left == right时,区间[left, right)属于空集,所以用 < 避免该情况
|
||||
int middle = left + (right - left) / 2;
|
||||
if(nums[middle] < target){
|
||||
//target位于(middle , right) 中为保证集合区间的左闭右开性,可等价为[middle + 1,right)
|
||||
@ -556,7 +557,7 @@ int search(int* nums, int numsSize, int target){
|
||||
}else if(nums[middle] > target){
|
||||
//target位于[left, middle)中
|
||||
right = middle ;
|
||||
}else{// nums[middle] == target ,找到目标值target
|
||||
}else{ // nums[middle] == target ,找到目标值target
|
||||
return middle;
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user