运行结果
代码
class Solution {
public:
int search(vector<int>& nums, int target) {
int beg = 0, end = nums.size();
while (beg != end) {
int mid = beg + (end - beg) / 2;
if (nums[mid] == target) return mid;
nums[mid] > target ? end = mid : beg = mid + 1;
}
return -1;
}
};