题解 | #二分查找-I#

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