题目描述:
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。请必须使用时间复杂度为 O(log n) 的算法。示例:
输入: nums = [1,3,5,6], target = 5
输出: 2输入: nums = [1,3,5,6], target = 2
输出: 1输入: nums = [1,3,5,6], target = 7
输出: 4输入: nums = [1,3,5,6], target = 0
输出: 0输入: nums = [1], target = 0
输出: 0
#include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
// 暴力法
int searchInsert_1(vector<int>& nums, int target) {
for(int i=0; i<nums.size(); i++){
if(target <= nums[i]){
return i;
}
}
return nums.size();
}
// 二分法
int searchInsert_2(vector<int>& nums, int target) {
int left = 0, right = nums.size()-1;
while(left <= right){
// 防止 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-1;
}
}
return left;
}
};
int main()
{
vector<int> arr = {1,3,5,6};
Solution solution;
int res1 = solution.searchInsert_1(arr, 7);
int res2 = solution.searchInsert_2(arr, 7);
cout << res1 << endl;
cout << res2 << endl;
return 0;
}