35. Search Insert Position
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
Solution
(1) Java
class Solution {
public int searchInsert(int[] nums, int target) {
if (nums.length == 0) {
return 0;
}
int start = 0;
int end = nums.length-1;
while (start < end) {
int mid = start + (end-start)/2;
if (nums[mid] == target) {
return mid;
}
if (nums[mid] > target) {
end = mid;
} else {
start = mid+1;
}
}
return target > nums[end] ? nums.length : end;
}
}
(2) Python
class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
if not nums:
return 0
start, end = 0, len(nums)-1
while start <= end:
mid = int(start+(end-start)/2)
if nums[mid] == target:
return mid
if nums[mid] > target:
end = mid-1
else:
start = mid+1
return start