要求:
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.
[1,3,5,6]
, 5 → 2
[1,3,5,6]
, 2 → 1
[1,3,5,6]
, 7 → 4
[1,3,5,6]
, 0 → 0
注意:首先想法就是遍历整个数组,算法复杂度为O(n)。其次可以使用二分法查找,复杂度更低
遍历法:
public int searchInsert(int[] nums, int target) {
for (int i = 0; i < nums.length; i++)
if (nums[i] >= target)
return i;
return nums.length;
}
二分法查找:
public int searchInsert(int[] nums, int target) {
int low = 0, high = nums.length - 1, mid;
while (low <= high) {
mid = low + (high - low) / 2;
if (nums[mid] == target)
return mid;
else if (nums[mid] > target)
high = mid - 1;
else
low = mid + 1;
}
return low;
}