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
思路:binary search,注意最后start 和end的判断,先判断target <= start, target <= end, 最后如果target > end, return end + 1;
class Solution {
public int searchInsert(int[] nums, int target) {
if(nums == null || nums.length == 0) {
return 0;
}
int start = 0; int end = nums.length - 1;
while(start + 1 < end) {
int mid = start + (end - start) / 2;
if(nums[mid] == target) {
return mid;
} else if(nums[mid] > target) {
end = mid;
} else {
//nums[mid] < target;
start = mid;
}
}
if(target <= nums[start]) {
return start;
}
if(nums[start] < target && target <= nums[end]) {
return end;
}
return end + 1;
}
}