二分查找

二分查找的基础框架（闭区间）

int searchInsert(vector<int>& nums, int target) 
{
    int left = 0, right = nums.size() - 1, mid;

    while(left <= right)
    {
        mid = left + (right - left) / 2;
        if(nums[mid] < target) left = mid + 1;
        else right = mid - 1;
    }

    return left;
}

普通二分查找问题

螺旋二分查找问题