题目:
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
思路: 二分查找。
代码
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int left=0, right=nums.size()-1, index=-1;
while(left <= right){ //二分查找target
int mid = (left+right)/2;
if(nums[mid]<target) left=mid+1;
else if(nums[mid]>target) right=mid-1;
else{
index = mid;
break;
}
}
//若不存在,则寻找插入位置。最后left==right,若target比nums[left]小,插到left;否则插到right+1
if(index == -1){
index = (nums[left]>target)? left : right+1;
}
return index;
}
};