python 小知识-优快云博客

本文链接：https://blog.youkuaiyun.com/qq_43382616/article/details/117575628

这篇博客探讨了Python中的堆排序算法heapq，并展示了如何使用bisect模块进行二分查找。通过示例代码，解释了heapq的heappush、heappop等方法，以及bisect_left和bisect_right的区别。同时，还介绍了自定义类实现比较操作并在堆中使用的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import bisect as bs

arr=[1,2,3,3,3,5,6]
print(bs.bisect(arr,3))
print(bs.bisect_left(arr,3))
print(bs.bisect_right(arr,3))


print(bs.bisect(arr,4))
print(bs.bisect_left(arr,4))
print(bs.bisect_right(arr,4))

5
2
5
5
5
5

import heapq as hp
class Xxm:
    def __init__(self,aa,strr):
        self.a=aa
        self.ss=strr
    def __lt__(self,other):
        return self.ss>=other.ss
def printXxm(arr1):
    for i in arr1:
        print(i.a,i.ss)
arr=[]
hp.heappush(arr,Xxm(0,"aaaa"))
hp.heappush(arr,Xxm(2,"bbb"))
hp.heappush(arr,Xxm(4,"ddd"))

hp.heappush(arr,Xxm(6,"c"))

printXxm(arr)



arr = []
arr.append(Xxm(0,"aaaa"))
arr.append(Xxm(2,"dd"))
arr.append(Xxm(4,"ccc"))

def cmp1(elem1,elem2):
    if elem1.ss<elem2.ss:
        return -1
    elif elem1.ss>elem2.ss:
        return 1
    else:
        return 0
printXxm(arr)
arr.sort()
printXxm(arr)

4 ddd
6 c
2 bbb
0 aaaa
0 aaaa
2 dd
4 ccc
2 dd
4 ccc
0 aaaa

import heapq as hp

arr=[]
hp.heapify(arr)
hp.heappush(arr,1)
hp.heappush(arr,3)
hp.heappush(arr,-2)

print(arr)

hp.heappop(arr)
print(arr)

hp.heappop(arr)
print(arr)

hp.heappushpop(arr,999)
print(arr)


class Xxm:
    def __init__(self,a,b):
        self.aa=a
        self.bb=b
    def __lt__(self,other):
        return self.bb<other.bb

arr1=[]
hp.heappush(arr1,Xxm(1,3))
hp.heappush(arr1,Xxm(3,2))
hp.heappush(arr1,Xxm(4,0))

tmp=hp.heappop(arr1)
# tmp=
# print(hp.heappop(arr1))
print(tmp.aa,tmp.bb)
for i in range(len(arr1)):
    print(arr1[i].aa,arr1[i].bb)

[-2, 3, 1]
[1, 3]
[3]
[999]
4 0
3 2
1 3