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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
思路:
1.for循环遍历一遍,复杂度O(N)
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for(int i=0;i<nums.size();i++)
{
if(nums[i]>=target)
{
return i;
}
}
return nums.size();
}
};
2.二分查找,时间复杂度为O(log(N))
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left=0;
int right=nums.size()-1;
while(left<=right)
{
int mid=(left+right)/2;
if(target==nums[mid])
{
return mid;
}
else if(target>nums[mid])
{
left=mid+1;
}
else if(target<nums[mid])
{
right=mid-1;
}
}
return left;
}
};