Leetcode 35. Search Insert Position
Posted lettuan
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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
思路: 通过观察可以发现,这一题其实就是要求array中>=target的第一个元素的位置。注意要将right设置成len(array),因为如果array中没有>=target的数,最后的情况是left=right=len(array)。
1 class Solution(object): 2 def searchInsert(self, nums, target): 3 """ 4 :type nums: List[int] 5 :type target: int 6 :rtype: int 7 """ 8 9 if not nums: 10 return 0 11 12 n = len(nums) 13 left, right = 0, n 14 15 while left < right: 16 mid = left + (right - left)/2 17 if nums[mid] >= target: 18 right = mid 19 else: 20 left = mid + 1 21 22 return left 23
以上是关于Leetcode 35. Search Insert Position的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode]Binary Search-35. Search Insert Position
LeetCode 35. Search Insert Position
[Binary Search] Leetcode 35, 74
LeetCode OJ 35. Search Insert Position