简单二分查找代码c++

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int len = nums.size();
        int left = 0, right = len - 1;
        while (left <= right) {
            int mid = (right - left) / 2 + left;
            if (nums[mid] == target) {
                return mid;
            } else if (target > nums[mid]) {
                left = mid + 1; // 应该去右边找
            } else {
                right = mid - 1; // 去左边找
            }
        }
        return -1;
    }
};