1.题目
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
2.思路
采用类似二分搜索的思路。low指向搜索范围的左端,high指向搜索范围右端。在low<=high的条件下进行循环。
①当nums[low]>target时,说明应该插入low左侧,即返回low;
②当nums[high]<target时,说明应该插入high右侧,即返回high+1;
③不在①②情况之列,则说明在nums[low]~nums[high]的范围中,取中间值nums[mid]与target进行比较,进行调整:
a.nums[mid]>target,说明high应左移;
b.nums[mid]<target,说明low应右移;
c.nums[mid]=target,返回mid值。
3.算法
public int searchInsert(int[] nums, int target) {
int length=nums.length;
if(length==0){
return 0;
}
int low=0;
int high=length-1;
int mid;
while(low<=high){
if(nums[low]>target)
return low;
if(nums[high]<target)
return high+1;
mid=low+(high-low)/2;
if(nums[mid]<target)
low++;
if(nums[mid]>target)
high--;
if(nums[mid]==target)
return mid;
}
return 0;
}