00001

力扣704 二分查找

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