代码
class Solution {
public:
int search(vector<int>& nums, int target)
{
if(nums.size()<=0)
return -1;
int low=0;
int high=nums.size()-1;
int mid=0;
while(low<=high)
{
mid=low+(high-low)/2;
if(nums[mid]==target)
return mid;
if(nums[mid]<target)
low=mid+1;
else
high=mid-1;
}
return -1;
}
};
思路
将数组的中间元素与目标值进行对比