LeetCode 704.二分查找

主页有其他数据结构内容（持续更新中）

难度：Easy

代码：

使用蓝红二分法模板

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n = nums.size();
        int left = -1;
        int right = n;
        while (left + 1 < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] <= target) {
                left = mid;
            } 
            else {
                right = mid;
            }
        }
        if (left == -1 || nums[left] != target) {
            return -1;
        }
        else {
            return left;
        }
    }
};