题目

WeChat5ba6c82a1be389ba2fee4dda6c485bc5.png

要点

  • Binary Search

代码

  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.         l = 0
  9.         r = len(nums) - 1
  11.         while(l<=r):
  12.             mid = (l + r)//2
  13.             if nums[mid] == target:
  14.                 return mid
  15.             elif nums[mid] < target:
  16.                 l = mid + 1
  17.             else:
  18.                 r = mid - 1
  19.         return l

分析

二分查找(binary search)是算法中必须掌握的基础算法之一。此题与二分法无异