moonlightshadow123
4/10/2017 - 2:57 PM

35-Search-Insert-Position https://leetcode.com/problems/search-insert-position/

35-Search-Insert-Position https://leetcode.com/problems/search-insert-position/

bSearch.py
content_copyfile_download

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        high = len(nums) - 1
        low = 0
        while high > low :
            mid = (high + low) / 2
            if nums[mid] < target:
                low = mid + 1 
            elif nums[mid] > target:
                high = mid - 1
            else:
                return mid
        if target <= nums[low]:
            return low
        else:
            return low + 1
35-Search-Insert-Position.md
content_copyfile_download
  • Rendered
  • Source

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