给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
请必须使用时间复杂度为
O(log n)
的算法。示例 1:
输入: nums = [1,3,5,6], target = 5 输出: 2示例 2:
输入: nums = [1,3,5,6], target = 2 输出: 1示例 3:
输入: nums = [1,3,5,6], target = 7 输出: 4提示:
1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums
为 无重复元素 的 升序 排列数组-104 <= target <= 104
无脑二分
class Solution {
public:
int erfs(vector<int>& nums, int left, int right, int target) {
int k = right;
if (left == right) {
if(target <= nums[left]) k = left;
else k = right+1;
return k;
}
if (left + 1 == right) {
if (nums[left] == target) k = left;
else if (nums[right] == target) k = right;
else if (target < nums[left]) k = left;
else if (target > nums[right]) k = right + 1;
else k = right;
return k;
}
int mid = (left + right) / 2, res;
if (target > nums[mid]) res = erfs(nums, mid, right, target);
else res = erfs(nums, left, mid, target);
return res;
}
int searchInsert(vector<int>& nums, int target) {
int res = erfs(nums, 0, nums.size()-1, target);
return res;
}
};