【LeetCode with Python】 Search Insert Position__Python

來源:互聯網
上載者:User
部落格網域名稱: 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

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.