Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6]
, 5 → 2
[1,3,5,6]
, 2 → 1
[1,3,5,6]
, 7 → 4
[1,3,5,6]
, 0 → 0
二分查找,时间复杂度O(logn)
class Solution {
public:
int binaryFind(vector<int>& nums,int low,int high,int target){
if(low>high)
return low;
int m=(low+high)/2;
if(nums[m]==target)
return m;
else if(nums[m]<target){
low++;
return binaryFind(nums,low,high,target);
}
else{
high--;
return binaryFind(nums,low,high,target);
}
}
int searchInsert(vector<int>& nums, int target) {
return binaryFind(nums,0,nums.size()-1,target);
}
};