leetcode35 搜索插入位置
c++
方法1:
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (int i = 0; i < nums.size(); i++){
if (target == nums[i]){
return i;
}
else if (target < nums[i]) {
return i;
}
}
return nums.size();
}
};
int main() {
vector<int> test1 {1,3,5,6};
Solution s;
int n = s.searchInsert(test1, 7);
cout << n;
return 0;
}
方法2:
二分法讲解
只要看到面试题里给出的数组是有序数组,且无重复,都可以想一想是否可以使用二分法
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0;
int right = nums.size()-1;
int middle;
while(left <= right){
middle = left + (right-left)/2;
if (nums[middle] < target){
left = middle+1;
}else if (nums[middle] > target){
right = middle-1;
}
else {
return middle;
}
}
return right + 1;
}
};
int main() {
vector<int> test1 {1,3,5,6};
Solution s;
int n = s.searchInsert(test1, 0);
cout << n;
return 0;
}
方法3:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int n = nums.size();
int left = 0;
int right = n; // 定义target在左闭右开的区间里,[left, right) target
while (left < right) { // 因为left == right的时候,在[left, right)是无效的空间
int middle = left + (right - left)-1;
if (nums[middle] > target) {
right = middle; // target 在左区间,在[left, middle)中
} else if (nums[middle] < target) {
left = middle + 1; // target 在右区间,在 [middle+1, right)中
} else { // nums[middle] == target
return middle; // 数组中找到目标值的情况,直接返回下标
}
}
// 分别处理如下四种情况
// 目标值在数组所有元素之前 [0,0)
// 目标值等于数组中某一个元素 return middle
// 目标值插入数组中的位置 [left, right) ,return right 即可
// 目标值在数组所有元素之后的情况 [left, right),return right 即可
return right;
}
};
python
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums)-1
while (left <= right):
middle =int((right - left)/2 + left)
if (target < nums[middle]): # 在左边
right = middle - 1
elif target > nums[middle] : # 在右边
left = middle + 1
else :
return middle
return right+1