int searchInsert(vector<int>& nums, int target) {
int l=0;
int r=nums.size();
int mid=0;
while(l<r){
mid=(l+r)/2;
if(nums[mid]>target){
r=mid;
}else if(nums[mid]<target){
l=mid+1;
}else{
return mid;
}
}
nums.insert(nums.begin()+l,target);
return l;
}
标签:二分,nums,int,mid,查找,leetcode35
From: https://www.cnblogs.com/lwx11111/p/16640643.html