python heapq_Python的heapq使用自定义比较predicate

最新推荐文章于 2024-05-11 10:00:00 发布

weixin_39797532

最新推荐文章于 2024-05-11 10:00:00 发布

阅读量397

点赞数

文章标签： python heapq

本文链接：https://blog.csdn.net/weixin_39797532/article/details/111420316

版权

本文介绍了如何在Python中使用heapq模块创建一个使用自定义比较谓词的堆。由于堆中的元素是用户自定义类型，无法直接修改内置比较方式。通过创建一个名为MyHeap的类，该类包装了heapq函数，并允许在初始化时指定key函数，从而在插入元素时计算关键值。这个类提供push和pop方法，以自定义排序方式操作堆。

摘要由CSDN通过智能技术生成

I am trying to build a heap with a custom sort predicate. Since the values going into it are of 'user-defined' type, I cannot modify their built-in comparison predicate.

Is there a way to do something like:

h = heapq.heapify([...], key=my_lt_pred)

h = heapq.heappush(h, key=my_lt_pred)

Or even better, I could wrap the heapq functions in my own container so I don't need to keep passing the predicate.

解决方案

According to the heapq documentation, the way to customize the heap order is to have each element on the heap to be a tuple, with the first tuple element being one that accepts normal Python comparisons.

The functions in the heapq module are a bit cumbersome (since they are not object-oriented), and always require our heap object (a heapified list) to be explicitly passed as the first parameter. We can kill two birds