搜索插入位置：Search Insert Position

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