35. Search Insert Position -- Python

35. Search Insert Position

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:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 1:

Input: [1,3,5,6], 0
Output: 0

思路：
刚看到这个题目以后第一想法是用二分法，然后再递归比较大小好了，因为基础薄弱，想法是这样，实现起来却还是一波三折，最后在讨论区看到人家一条语句就出来了，真的是…

代码：

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        if len(nums)==1:
            if nums[0]>=target:
                return 0
            else:
                return 1
        if len(nums)==0:
            return 0
        if len(nums)>=2:
            z=len(nums)//2
            if nums[z]>=target:
                return self.searchInsert(nums[0:z],target)
            if nums[z] < target:
                return z + self.searchInsert(nums[z+1:],target)+1

人家的代码：

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        return len([x for x in nums if x<target])

我的第一个版本代码：（未能正常运行）

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        def erfen(x,y):
            if len(x) >= 2:
                z=len(x)//2
                if x[z] < y and  (y - x[z] != 1):
                     erfen(x[z+1:],y)
                 elif x[z] > y and (x[z]-y != 1):
                     erfen(x[0:z],y)
                 elif x[z] > y and (x[z] - y == 1):
                     return nums.index(x[z])
                 elif x[z] < y and (y - x[z] == 1):
                     return nums.index(x[z])+1
             elif len(nums)==1:
                 if x[0]>y:
                     return nums.index(x[0])
                 else:
                     return  nums.index(x[0])+1
             elif len(nums)==0:
                 return 0

        counter=nums.count(target)
         if counter==0:
             if nums[0]>target:
                 return 0
             elif nums[-1]<target:
                 return len(nums)
             else:
                 return erfen(nums,target)
         else:
             return nums.index(target)