题解 | #二分查找-I#

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

        int begin = 0;
        int end = nums.size() - 1;
        int middle = 0;

        while (begin <= end) {
            middle = (begin + end + 1) / 2;
            if (target == nums[middle]) {
                return middle;
            } else if (target > nums[middle]) {
                begin = middle + 1;
            } else {
                end = middle - 1;
            }
        }

        return -1;

    }
};