LeetCode704. 二分查找(C++)

LeetCode704. 二分查找

• • 题目链接
  • 代index.php/tags-41973.html" class="superseo">���

    题目链接

    https://leetcode.cn/problems/binary-search/description/

    

    代码

    class Solution {
    public:
        int search(vector& nums, int target) {
            int left = 0;
            int right = nums.size() - 1;
            while(left 
                int middle = left + (right - left) / 2;
                if(nums[middle]  target){
                    right = middle - 1;
                }
                else if(nums[middle]