class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
l=0
r=len(nums)-1
while l<=r:
mid=(l+r)/2
if nums[mid]==target:
return mid
elif nums[mid]<target:
l=mid+1
else:
r=mid-1
return l
还是二分查找,非递归形式,记得改起点的时候l=mid+1,r=mid-1