/**
左侧找最后一个大于等于的
右侧找第一个小于等于的
*/
class Solution {
public int searchInsert(int[] nums, int target) {
int len = nums.length;
if(len == 0) return 0;
int left = 0;
int right = len-1;
while(left <= right)
{
int mid = (right-left)/2+left;
if(nums[mid] > target)
right = mid-1;
else if(nums[mid] < target)
left = mid+1;
else
return mid;
}
return left;
}
}
35. 搜索插入位置
最新推荐文章于 2024-03-06 08:30:00 发布