原题
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.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
题意
给出一个排好序的数组,和一个目标值,如果目标值在数组中出现,则返回该目标值的下标;如果没有出现,则把他插入数组中,然后返回他在数组中下标。
思路
代码
public class Solution {
public int searchInsert(int[] nums, int target) {
int len=nums.length;
int left=0,right=len-1;
while(left<=right){
int mid=(right-left)/2+left;
if(nums[mid]==target) return mid;
else if(nums[mid]<target)
left=mid+1;
else{
right=mid-1;
}
}
return left;
}
}