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
题目要求是:若数组中含有target值则返回该索引值,否则返回按序排列的插入索引。
与前几题类似,都是利用二分法进行查找。
实现代码如下:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int l=0;
int r=nums.size()-1;
if(l==r)
{
if(nums[0]<target)return 1;
else return 0;
}
while(l<=r)
{
int mid=(r-l)/2+l;
if(nums[mid]==target)
{
return mid;
}
else if(nums[mid]<target)
l=mid+1;
else
r=mid-1;
}
return l;
}
};