int minusTwoSearch(vector<int> &nums, int start, int end, int target) {
if(nums[start] == target)
return start;
if(nums[end] == target)
return end;
while(end - start > 1) {
int mid = (start + end) / 2;
if(nums[mid] == target)
return mid;
if(nums[mid] > target) {
end = mid;
}else {
start = mid;
}
}
return -1;
}
二分查找组件
最新推荐文章于 2023-02-04 16:37:30 发布