35. Search Insert Position
Easy
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
解答1:
class Solution:
def searchInsert(self, nums, target) :
"""
:type nums:List[int]
:type target:int
:rtype :int
"""
if len(nums)==0:
return 0
for i in range(len(nums)):
if target <= nums[i]:
return i;
return len(nums)
解答2:二分法查找
class Solution:
def searchInsert(self, nums, target) :
"""
:type nums:List[int]
:type target:int
:rtype :int
"""
if len(nums)==0:
return 0
left=0
right=len(nums)-1
while(left<=right):
middle=int((left+right)/2)
if (target==nums[middle]):
return middle
elif (target>nums[middle]):
left=middle+1
else:
right=middle-1
return left