public class Solution {
public int searchInsert(int[] nums, int target) {
if (nums == null || nums.length < 1) {
return -1;
}
int left = 0;
int right = nums.length - 1;
int mid = 0;
while (left < right) {
mid = left + (right - left) / 2;
if (nums[mid] == target) {
return mid;
}
if (nums[mid] > target) {
right = mid;
} else {
left = mid;
}
if (right - left == 1) {
break;
}
}
if (nums[left] >= target) {
return left;
} else if (nums[right] >= target) {
return right;
} else {
return right + 1;
}
}
}
Search Insert Position
最新推荐文章于 2024-01-15 10:06:47 发布