[leetcode]35. Search Insert Position
Analysis
做实验啊做实验!!!! —— [ ummm 可能遇见了一个有趣的人? ]
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.
这个题目很简单,给你一个排好序的数组,然后搜索target是否在数组中,如果在返回target的位置,如果不在就返回按照大小顺序,target应该插入的位置。
Implement
第一种方法是比较简单的,直接暴力搜~
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int len = nums.size();
if(nums[0]>target)
return 0;
if(nums[len-1]<target)
return len;
for(int i=0; i<len; i++){
if(nums[i]>=target)
return i;
}
}
};
第二种是二分搜索,时间复杂度低一点(但是这道题好像没要求)~
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int len = nums.size();
if(nums[0]>target)
return 0;
if(nums[len-1]<target)
return len;
int left = 0;
int right = len-1;
while(left<right){
int mid = left + (right - left)/2;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
left = mid+1;
else right = mid;
}
return right;
}
};