bisect

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.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值