bisect

最新推荐文章于 2026-01-07 13:36:22 发布

最新推荐文章于 2026-01-07 13:36:22 发布 · 153 阅读

文章标签：

#python

Python 专栏收录该内容

85 篇文章

订阅专栏

本文介绍了Python标准库中bisect模块的bisect_left函数。该函数用于在一个已排序的序列中找到指定元素的插入位置，确保序列仍保持有序状态。同时，如果元素已经存在于序列中，函数将返回在现有条目左侧的位置。

from bisect import bisect_left

a = ['liu', 'yuan', 'is', 'a', 'chinese']

bisect_left(a, 'is')

此模块可以查找已知的element在序列中的index（从左向右找出第一个）

Python Doc

http://docs.python.org/release/2.5/lib/module-bisect.html

<nobr><strong><tt id="l2h-746" class="function" style="font-family:'lucida typewriter',lucidatypewriter,monospace">bisect_left</tt></strong>(</nobr>

list, item[, lo[, hi]])

Locate the proper insertion point for itemin listto maintain sorted order. The parameters loand himay be used to specify a subset of the list which should be considered; by default the entire list is used. If itemis already present in list, the insertion point will be before (to the left of) any existing entries. The return value is suitable for use as the first parameter to list.insert(). This assumes that listis already sorted. New in version 2.1.