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
Subscribe to see which companies asked this question
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
index_f = 0
index_l = len(nums)
while True:
if nums[(index_f+index_l)/2] <= target:
index_f = (index_f+index_l)/2
elif nums[(index_f+index_l)/2] > target:
index_l = (index_f+index_l)/2
if index_l - index_f <= 1:
if nums[index_f] >= target:
return index_f
return index_l