给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
实例1
输入: nums = [1,3,5,6], target = 5 输出: 2
实例2
输入: nums = [1,3,5,6], target = 2 输出: 1
pubilc int searchInsert(int[] nums , int target){
int left = 0,right = nums.length;
while(left < right){
int mid = left + (right - left) / 2;
if (nums[mid] = target){
return mid;
}else if (num[mid] > target){
right = mid - 1;
}else {
left = mid + 1;
}
}
for (int i = 0 ; i < nums.length ; i++){
if (nums[i] >= target){
retun i ;
}
}
return nums.length;
}