class Solution {
public:
int searchInsert(vector<
int>& nums,
int target) {
int len=
nums.size();
if(len <
1)
return 0;
int low=
0,high=len-
1;
int mid;
while(low<=
high)
{
mid=(low+high)/
2;
if(nums[mid] ==
target)
return mid;
else if(target >
nums[mid])
low=mid+
1;
else
high=mid-
1;
}
if(nums[mid]>
target)
return mid;
else
return mid+
1;
}
};
转载于:https://www.cnblogs.com/vincent93/p/7619835.html
相关资源：JAVA上百实例源码以及开源项目
