Leetcode||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.

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

这题还是用二分查找比较实用,也算是一个比较耿直的二分查找变种

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



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Lingfu74/article/details/78222984
文章标签: python leetcode
个人分类: leetcode python
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭