Given a sorted array of distinct integers 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 must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [1,3,5,6], target = 5 Output: 2
Example 2:
Input: nums = [1,3,5,6], target = 2 Output: 1
Example 3:
Input: nums = [1,3,5,6], target = 7 Output: 4
Constraints:
1 <= nums.length <= 104-104 <= nums[i] <= 104nums contains distinct values sorted in ascending order.-104 <= target <= 104class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
// Range of Answer : [0, n]
int lt=0, rt=nums.size()-1, mid;
while(lt<=rt){
mid = lt+(rt-lt)/2;
if(nums[mid]==target)
return mid;
nums[mid]<target?lt=mid+1:rt=mid-1;
}
return lt;
}
};class Solution {
public int searchInsert(int[] nums, int target) {
int lt = 0, rt = nums.length - 1;
while (lt <= rt) {
int mid = (lt + rt) / 2;
if (nums[mid] == target)
return mid;
else if (nums[mid] < target) {
lt = mid + 1;
} else {
rt = mid - 1;
}
}
return lt;
}
}