Description

Submission

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;

        while(left < right) {
            int mid = right - (right - left) / 2;

            if(nums[mid] > target) {
                right = mid - 1;
            } else {
                left = mid;
            }
        }
        if(nums[left] == target) return left;
        return -1;
    }
};