要求:一个数在数组索引或者应该插入的位置
思路:二分,找最后一个比它小的数(右边界返回right),加一
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left=0,right=nums.size()-1;
while(left<=right){
int mid=left+(right-left)/2;
if(nums[mid]==target)return mid;
else if(nums[mid]<target)left=mid+1;
else right=mid-1;
}
return right+1;
}
};