题目:
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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
题意:
查找目标值在数组中是否出现,若出现则返回对应的下标值;否则返回比目标值大的第一个数字的下标
思路:
简单点,暴力循环一波走;
让题目有点意思的话,二分法。
当然是选择二分它啦啦啦~~~
Code:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int l=0,r=nums.size()-1;
while(l<=r){
int mid=(l+r)/2;
if(nums[mid]==target) return mid;
if(nums[mid]<target) l=mid+1;
else r=mid-1;
}
return l;
}
};