题解 | #二分查找-I#

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