search_insert_position.py

classSolution: 

# main idea:
# use 'binary_search' for a 'sorted array'
# be careful: If not, return the index where it would be 'if it were inserted' in order

defmy_binary_search(self, nums, target, begin, end):

# calculate the mid (by using 'plus')
mid= (end+begin) //2
print(mid)

# set the 'stopping' condition
ifbegin>end:
# be careful: return the 'Insert Position' => return 'begin'
returnbegin
elifnums[mid] ==target:
returnmid
# the recursion of binary search
elifnums[mid] <target:
returnself.my_binary_search(nums, target, mid+1, end)
elifnums[mid] >target:
returnself.my_binary_search(nums, target, begin, mid-1)
#else:
# return 0

defsearchInsert(self, nums: List[int], target: int) ->int:

# return the 'index'
index=self.my_binary_search(nums, target, 0, len(nums)-1)
returnindex