leetcode 刷题:
搜索插入位置:二分法
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length;
while (right > left) {
int mid = left + (right - left) / 2;
if (nums[mid] >= target) {
right = mid;
} else {
left = mid + 1;
}
}
return left;
}
}
2020-10-11
最新推荐文章于 2021-10-08 09:27:20 发布