题解 | 二分查找-I

#include <ostream>
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() - 1, z;
        while (l <= r) {
            z = (l + r) / 2;
            if (nums[z] > target) {
                r = z - 1;
            } else if (nums[z] < target) {
                l = z + 1;
            } else {
                return z;
            }
            //cout << l << " " << r << " " << z<<endl;
        }
        return -1;
    }
};