LeetCode#35 Search Insert Position

Problem Definition：

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

Solution：

还是二分查找，注意返回插入位置的表示。

    # @param {integer[]} nums
    # @param {integer} target
    # @return {integer}
    def searchInsert(self, nums, target):
        return self.recur(nums, target, 0, len(nums)-1)
    
    def recur(self, nums, target, start, end):
        if start==end:
            if nums[start]>=target:
                return start
            else:
                return start+1
        else:
            mid=(start+end)/2
            if nums[mid]==target:
                return mid
            elif nums[mid]>target:
                return self.recur(nums, target, start, mid)
            else:
                return self.recur(nums, target, mid+1, end)