搜索插入位置 有序数组 二分查找 - lifengyu360/lifengyu_first_git_test GitHub Wiki

int searchInsert(vector<int>& nums, int target) {
    int left=0,right=nums.size()-1;
    while(left<=right)
    {
        int mid=(left+right)/2;
        if(nums[mid]==target)
            return mid;
        else if(nums[mid]<target)
            left=mid+1;
        else
            right=mid-1;
    }
    return left;
}