题解 | #二分查找-I#

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