这个模块只有几个函数,一旦决定使用二分搜索时,立马要想到使用这个模块.
>>>import bisect
>>>dir(bisect)
[‘builtins‘, ‘cached‘, ‘doc‘, ‘file‘, ‘loader‘, ‘name‘, ‘package‘, ‘spec‘, ‘bisect’, ‘bisect_left’, ‘bisect_right’, ‘insort’, ‘insort_left’, ‘insort_right’]
举例说明:
L = [1,3,3,6,8,12,15]
x=4
bisect.insort(L,x)#插入 L则变为[1, 3, 3, 4, 6, 8, 12, 15]
bisect.bisect(L,x)#返回应该插入的位置 L不变
应用举例:
leetcode:436. Find Right Interval
原题:
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the “right” of i.
For any interval i, you need to store the minimum interval j’s index, which means that the interval j has the minimum start point to build the “right” relationship for interval i. If the interval j doesn’t exist, store -1 for the interval i. Finally, you need output the stored value of each interval as an array.
给一个输入输出的例子
Example :
**Input:** [ [3,4], [2,3], [1,2] ] **Output:** [-1, 0, 1] **Explanation:** There is no satisfied "right" interval for [3,4]. For [2,3], the interval [3,4] has minimum-"right" start point; For [1,2], the interval [2,3] has minimum-"right" start point.
使用bisect的解题思路:
- 先使用枚举enumerate,把下标和开始值枚举出来并排序
- 使用bisect函数确定每一个end应该插入的位置
# Definition for an interval.
# class Interval(object):
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e
class Solution(object):
def findRightInterval(self, intervals):
"""
:type intervals: List[Interval]
:rtype: List[int]
"""
l = sorted((e.start, i) for i, e in enumerate(intervals))
n=len(l)
res = []
for e in intervals:
r = bisect.bisect_left(l, (e.end,))
res.append(l[r][1] if r < n else -1)
return res