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