二分查找:力扣704
左开右闭
class Solution {
public:
int search(vector<int>& nums, int target) {
int left=0,right=nums.size();
while(left<right)
{
int mid=(left+right)/2;
if(target<nums[mid])
{
right=mid;
}
else if(target>nums[mid])//用else if不是用else
{
left=mid+1;
}
else
return mid;
}
return -1;
}
};
左闭右闭
class Solution {
public:
int search(vector<int>& nums, int target) {
int left=0,right=nums.size()-1;
while(left<=right)
{
int mid=(left+right)/2;
if(target<nums[mid])
{
right=mid-1;
}
else if(target>nums[mid])
{
left=mid+1;
}
else
return mid;
}
return -1;
}
};