LeetCode 704 二分查找模板题

题目链接

AC代码：

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while(left<=right){ //左闭右闭区间写法
            int mid = (left + right) / 2;
            if(nums[mid]<target){
                left = mid+1;
            }
            else if(nums[mid]>target){
                right = mid-1;
            }
            else return mid;
        }
        return -1;
    }
};

变种思考：

解题思路