704.二分查找

代码随想录学习笔记

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left=0;
        int right=nums.size()-1;
        while(left<=right){//左闭右闭区间小于等于作为判定条件
            int middle=(left+right)/2;
            if(target<nums[middle])//小于目标，将范围定在左边，又因为范围是左闭右闭的，需要middle-1
                right=middle-1;
            else if(target>nums[middle])
                left=middle+1;
            else if(target==nums[middle])
                return middle;
        }
        return -1;
    }
};