Leetcode_Search Insert Position

Tag
Array/Binary Search
Difficulty
Easy
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.
Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
Code

class Solution(object):    def searchInsert(self, nums, target):        """        :type nums: List[int]        :type target: int        :rtype: int        """        start = 0        end = len(nums)        while(start<end-1):            mid = (start + end)/2            if nums[mid]<target:                start = mid            elif nums[mid]>target:                end = mid            else:                return mid        if nums[start] >= target:            return start        return start+1