题解 | #二分查找-I#

#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @param target int整型 
     * @return int整型
     */

    int twoLook(vector<int> nums,int left,int right,int target)
    {
        if(left > right)
        {
            return -1;
        }
        int mid = (left + right) / 2;
        if(target == nums[mid]) return mid;
        else if(target < nums[mid])
        {
            right = mid-1;
        }
        else {
            left = mid+1;
        }
        return twoLook(nums, left, right,target);
    }


    int search(vector<int>& nums, int target) {
        // write code here
        return twoLook(nums, 0, nums.size()-1,target);
        
    }
};