class Solution {
public int searchInsert(int[] nums, int target) {
int left=0,right=nums.length-1;
int mid=-1;
while(left<=right){
mid=left+(right-left)/2;
if(nums[mid]<target){
left=mid+1;
}else if(nums[mid]>target){
right=mid-1;
}else{
return mid;//找到了则返回下标
}
}
return left;//没找到则返回其位置左边的下标,即为它按顺序插入的位置
}
}