题目大意:找到目标数字应该插入所给不重复升序数组的下标位置
分析:二分搜索。普通遍历也可以,二分查找的效率更高。
代码:
方法一:普通遍历
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (int i = 0;i < nums.size();i++) {
if (nums[i] == target) return i;
if (nums[i] > target) return i;
}
return nums.size();
}
};
方法二:二分查找
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (target < nums[mid]) {
right = mid - 1;
}
else if (target > nums[mid]) {
left = mid + 1;
}
else {
return mid;
}
}
return left; //没找到target的情况
}
};