class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size();
if(nums.size() == 0)
{
return -1;
}
if(nums.size() == 1)
{
if(nums[0] == target)
return 0;
else
return -1;
}
while(left <= right)
{
int middle = left + (right -left)/2;
if(target > nums[middle])
{
left = middle + 1;
}
else if(target < nums[middle])
{
right = middle -1;
}
else
{
return middle;
}
}
return -1;
}
};