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
Difficulty:Medium
和34一样的思路
int searchInsert(vector<int>& nums, int target) {
int len = nums.size();
int start = 0;
int en = len - 1;
int middle,i = -1;
if(len==1&&nums[0]>target)
return 0;
if(len==1&&nums[0]<target)
return 1;
while(en>=start)
{
if(en-start==1&&nums[en]!=target&&nums[start]!=target)
break;
if(en-start==1&&nums[en]==target&&nums[start]!=target)
{
i = en;
break;
}
middle = start+((en-start)>>1);
if(nums[middle]==target)
{
i = middle;
break;
}
else if(nums[middle]>target)
en = middle;
else
start = middle;
}
//cout<<start<<" "<<en<<endl;
if(i!=-1)
return i;
else if(nums[en]<target)
return en+1;
else if(nums[start]>target)
return start;
else
return en;
}