【力扣 简单 C++】704. 二分查找

目录

题目

解法一：二分查找

---

题目

解法一：二分查找

class Solution
{
public:
    int search(vector<int>& nums, int target)
    {
        int size{static_cast<int>(nums.size())};
        int left{}, right{size - 1};

        while (left <= right)
        {
            int mid{(left + right) >> 1};

            if (nums[mid] < target)
            {
                left = mid + 1;
            } 
            else if (nums[mid] > target)
            {
                right = mid - 1;
            } 
            else
            {
                return mid;
            }
        }
        return -1;
    }
};