部落格網域名稱: http://www.xnerv.wang
原題頁面: https://oj.leetcode.com/problems/search-insert-position/
題目類型:二分尋找
難度評價:★★
本文地址: http://blog.csdn.net/nerv3x3/article/details/39453389
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
二分尋找的一個變種。如果找到了target,就返回下標(正常的二分尋找邏輯),否則就返回插入的位置。二分尋找容易搞暈的是到底是返回left還是right,注意到left最終一定停在target上,或停在target的“位置”的右邊,所以顯然找不到target時,應該返回left的下標作為插入位置。
class Solution: # @param A, a list of integers # @param target, an integer to be inserted # @return integer def searchInsert(self, A, target): if None == A: return 0 len_A = len(A) if target > A[len_A - 1]: return len_A if target < A[0]: return 0 left = 0 right = len_A - 1 while left <= right: # also can be left < right mid = (left + right) / 2 if A[mid] < target: left = mid + 1 elif A[mid] > target: right = mid - 1 else: return mid return left