35. Search Insert Position leetcode Python 2016 new season

最新推荐文章于 2022-07-28 17:11:36 发布

原创最新推荐文章于 2022-07-28 17:11:36 发布 · 483 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文详细解释了如何在一个已排序的整数数组中查找目标值的正确插入位置，确保数组保持有序。通过使用二分查找算法，提高了搜索效率。文章提供了代码示例并解释了每一步的操作原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Show Tags

Show Similar Problems

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