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)
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值