法1:二分查找
基础方法,必须掌握!
class Solution {
public int searchInsert(int[] nums, int target) {
if (nums.length == 0) {
return 0;
}
int left = 0, right = nums.length - 1, mid = 0;
while (left <= right) {
mid = left + (right - left) / 2;
if (nums[mid] >= target) {
right = mid - 1;
} else if (nums[mid] < target) {
left = mid + 1;
}
}
return left;
}
}