标签：
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
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.size()==0) return 0;
int flag=-1;
for(int i=0;i<nums.size();i++)
{
if(target<=nums[i])
{
flag=i;
break;
}
}
if(flag==-1)
{
flag=nums.size();
}
return flag;
}
};class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.size()==0) return 0;
int low=0,high=nums.size()-1;
while(low<=high)
{
int mid=(low+high)/2;
if(target>nums[mid]) low=mid+1;
else if(target<nums[mid]) high=mid-1;
else return mid;
}
}
};leetcode-Search Insert Position
标签：
原文地址：http://blog.csdn.net/sinat_24520925/article/details/45623345
