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
解法一:
二分法。不过要主要一个corner case就是max < target,直接返回size+1。
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.back()<target) return nums.size();
int left = 0, right = nums.size()-1;
int mid;
while(left<right){
mid = (left+right)/2;
if(nums[mid]==target) return mid;
else if(nums[mid]>target) right = mid;
else if(nums[mid]<target) left = mid+1;
}
return right;
}
};