The example in this article describes the usage of the bisect module in python and is shared with everyone for your reference.
The specific method is analyzed as follows:
This module only has a few functions. Once you decide to use binary search, you must immediately think of using this module.下 Example code is as follows:
import bisect L = [1,3,3,6,8,12,15] x = 3 x_insert_point = bisect.bisect_left(L,x)#在L中查找x,x存在时返回x左侧的位置,x不存在返回应该插入的位置..这是3存在于列表中,返回左侧位置1 print x_insert_point x_insert_point = bisect.bisect_right(L,x)#在L中查找x,x存在时返回x右侧的位置,x不存在返回应该插入的位置..这是3存在于列表中,返回右侧位置3 print x_insert_point x_insort_left = bisect.insort_left(L,x)#将x插入到列表L中,x存在时插入在左侧 print L x_insort_rigth = bisect.insort_right(L,x)#将x插入到列表L中,x存在时插入在右侧 print L
Python2.7.6
1 3 [1, 3, 3, 3, 6, 8, 12, 15] [1, 3, 3, 3, 3, 6, 8, 12, 15]