采用二分查找
class Solution {
public int searchInsert(int[] nums, int target) {
int start = 0;
int end = nums.length - 1;
if(nums.length == 0) return 0;
while(start < end){
int mid = (start + end)/2;
if(target == nums[mid]){
return mid;
}
else if(target < nums[mid]) {
end = mid;
}else
start = mid + 1;
}
if(target > nums[start]){
return start + 1;
}
else
return start;
}
}