题解 | #二分查找-I#

#include <vector>
class Solution {
public:
    int binarySearch(vector<int>& nums, int target, int start, int end)
    {
        if (end < start) {
            return -1;
        }
        int mid = (start + end)/2;
        if (nums[mid] < target) {
            start = mid + 1;
            return binarySearch(nums, target, start, end);
        }
        else if(nums[mid] > target){
            end = mid - 1;
            return binarySearch(nums, target, start, end);
        }
        else {
            return mid;
        }
    }
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @param target int整型 
     * @return int整型
     */
    int search(vector<int>& nums, int target) {
        // write code here
        return binarySearch(nums, target, 0, nums.size()-1);
    }
};