题目描述:
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 1:
Input: [1,3,5,6], 0
Output: 0
这题很简单,直接用二分查找就可以了。
class Solution {
public int searchInsert(int[] nums, int target) {
return divide(nums,0,nums.length-1,target);
}
public int divide(int[] nums,int left,int right,int target){
if(left>right) return left;
int mid=(left+right)/2;
if(nums[mid]==target){
return mid;
}else if(nums[mid]>target){
return divide(nums,left,mid-1,target);
}else{
return divide(nums,mid+1,right,target);
}
}
}