https://leetcode.com/problems/search-insert-position/
依然二分法 如果能找到直接返回index
如果找不到最后会逼近到s<target<e
那么target就应该插入到e所在的位置
class Solution:
# @param {integer[]} nums
# @param {integer} target
# @return {integer}
def searchInsert(self, nums, target):
s=0
e=len(nums)-1
if target<=nums[0]:
return 0
if target>nums[-1]:
return len(nums)
while s!=e-1:
if nums[(s+e)/2]<target:
s=(s+e)/2
elif nums[(s+e)/2]>target:
e=(s+e)/2
else:
return (s+e)/2
return e