关闭

Leetcode||35. Search Insert Position

标签: pythonleetcode
27人阅读 评论(0) 收藏 举报
分类:

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



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:47558次
    • 积分:2425
    • 等级:
    • 排名:第16132名
    • 原创:203篇
    • 转载:0篇
    • 译文:0篇
    • 评论:7条
    最新评论