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