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
这道题还是很简单的哈。考虑下特殊情况。然后写一个简单的Loop来比较大小就可以了。
代码如下。
public class Solution {
public int searchInsert(int[] nums, int target) {
//special case
if(nums==null||nums.length==0){
return 0;
}
//also special case
if(target<=nums[0]){
return 0;
}
for(int i=0;i<nums.length-1;i++){
if(nums[i+1]>=target&&target>=nums[i]){
return i+1;
}
}
return nums.length;
}
}