learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update 0035.搜索插入位置.md 

增加C语言两种版本，通过Leetcode测试
This commit is contained in:
vanyongqi 2022-09-30 10:23:25 +08:00 committed by GitHub
parent 12f2ecf564
commit 4276745f1b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0035.搜索插入位置.md
View File

@ -440,7 +440,7 @@ int searchInsert(int* nums, int numsSize, int target){
while(left <= right){//左闭右闭区间 所以可以 left == right while(left <= right){//左闭右闭区间 所以可以 left == right
mid = left + (right - left) / 2; mid = left + (right - left) / 2;
if(target < nums[mid]){ if(target < nums[mid]){
//target 在左区间 [left, middle - 1]中，原区间包含mid，右区间边界可以向左内缩 //target 在左区间 [left, mid - 1]中，原区间包含mid，右区间边界可以向左内缩
right = mid -1; right = mid -1;
}else if( target > nums[mid]){ }else if( target > nums[mid]){
//target 在右区间 [mid + 1, right]中,原区间包含mid，左区间边界可以向右内缩 //target 在右区间 [mid + 1, right]中,原区间包含mid，左区间边界可以向右内缩
@ -465,7 +465,7 @@ int searchInsert(int* nums, int numsSize, int target){
while(left < right){//左闭右闭区间 所以 left < right while(left < right){//左闭右闭区间 所以 left < right
mid = left + (right - left) / 2; mid = left + (right - left) / 2;
if(target < nums[mid]){ if(target < nums[mid]){
//target 在左区间 [left, mid)中，原区间没有包含mid，右区间边界可以不能内缩 //target 在左区间 [left, mid)中，原区间没有包含mid，右区间边界不能内缩
right = mid ; right = mid ;
}else if( target > nums[mid]){ }else if( target > nums[mid]){
// target 在右区间 [mid+1, right)中，原区间包含mid，左区间边界可以向右内缩 // target 在右区间 [mid+1, right)中，原区间包含mid，左区间边界可以向右内缩