leetcode704. 二分查找

C++

左闭右开

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

计算中点操作直接相加可能超出 int 类型的取值范围，从而导致计算错误。此时，使用此方法计算中点，避免问题。

或者：

闭区间

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