二分法我觉得讲的很好的链接:算法学习之——二分法解题超详细_与宇宙对视的博客-CSDN博客_二分法
leetcode 704
class Solution {
public:
int search(vector<int>& nums, int target) {
int l = 0, r = nums.size() - 1;
while(l <= r) {
int mid = (l + r) / 2;
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
l = mid + 1;
} else if (nums[mid] > target) {
r = mid - 1;
}
}
return -1;
}
};