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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
这题也殊为简单,一个二分法就能解出来,Accepted代码如下:
class Solution {
public int searchInsert(int[] nums, int target) {
int l = nums.length;
if (l == 0) {
return 0;
}
if (target < nums[0]) {
return 0;
}
if (target > nums[l - 1]) {
return l;
}
int start = 0, end = l - 1;
while (start < end) {
int mid = (start + end) / 2;
if (target == nums[mid]) {
return mid;
} else if (target < nums[mid]){
end = mid;
} else {
start = mid + 1;
}
}
return start;
}
}
此解法同样有双100%的超过率,我还是颇感惊讶。