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