60. Search Insert Position
Description:
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,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
Challenge
O(log(n)) time
Input test data (one parameter per line.)
Code:
1.
class Solution:
"""
@param A: an integer sorted array
@param target: an integer to be inserted
@return: An integer
"""
def searchInsert(self, A, target):
# write your code here
if not A or target<=A[0]:
return 0
if target > A[-1]:
return len(A)
for i in range(len(A)):
if A[i] == target:
return i
if A[i]<target and A[i+1]>target:
return i+1
2.
使用二分法进行优化:
class Solution:
"""
@param A: an integer sorted array
@param target: an integer to be inserted
@return: An integer
"""
def binSearch(self, A, target):
l = len(A)
half = int(l/2)
if target<A[0] or target>A[-1]:
return 0
elif (target>A[half-1] and target<A[half]) or (target == A[half]):
return half
left = self.binSearch(A[0:half], target)
right = self.binSearch(A[half:], target)
if left == 0:
return half+right
else:
return left
def searchInsert(self, A, target):
# write your code here
l = len(A)
if not A or target<=A[0]:
return 0
if target > A[-1]:
return l
return self.binSearch(A, target)