题解 | 二分查找-I

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @param target int整型 
     * @return int整型
     */
    int search(vector<int>& nums, int target) {
        // write code here
        int midl,left,right,ret = -1;
        left = 0;
        right = nums.size()-1;
        while(left<=right){

            if(right==left)
            {
                if(nums[left]==target){
                    ret = left;
                    return ret;
                }
            }

            midl = (left+right)/2;
            if(nums[midl] == target){
                ret = midl;
                break;
            }else if(nums[midl] < target)
            {
                left = midl+1;

            }else{
                right = midl-1;
            }
        }
        return ret;
    }
};