class Solution {
public int searchInsert(int[] nums, int target) {
int n=nums.length;
int low=0;
int high=n-1;
while(low<=high){
int mid=low+(high-low)/2;
if(nums[mid]>target){
high=mid-1;
}else if(nums[mid]<target){
low=mid+1;
}else{
return mid;
}
}
return high+1;
}
}
35. 搜索插入位置 Java版
最新推荐文章于 2023-03-12 11:00:38 发布