题目描述
解题思路:左闭右闭
int search(int* nums, int numsSize, int target){
int left = 0;
int right = numsSize - 1;
int mid;
while(left <= right){
mid = left +(right - left) / 2; //[left,right]
if( nums[mid] > target) {
right = mid -1;;
} else if (nums[mid] < target){
left = mid +1;
} else {
return mid;
}
}
return -1;
}
总结:
左闭右开的话
1.上面while(left< right)
2.>target 的时候 right = mid;