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
思路:二分法。最基本的二分查找法模版,注意找到了就返回mid,找不到就返回low,就是插入的位置。
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int low=0,high=nums.size()-1;
while(low<=high){
int mid=(low+high)/2;
if(nums[mid]<target) low=mid+1;
else if(nums[mid]>target) high=mid-1;
else return mid;
}
return low;
}
};