704. 二分查找

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(nums[middle]<target)
                left = middle+1;
            else if(nums[middle]>target)
                right = middle-1;
            else
                return middle;
        }
        return -1;
    }
};