你知道一个流行的库（Apache，Google等等，集合），它有一个最小最大堆的可靠Java实现，这个堆允许查看O(1)最小值和最大值，并删除O(log n)的元素？
Do you know of a popular library (Apache, Google, etc, collections) which has a reliable Java implementation for a min-max heap, that is a heap which allows to peek its minimum and maximum value in O(1) and to remove an element in O(log n)?
最满意答案
来自Guava： MinMaxPriorityQueue 。
From Guava: MinMaxPriorityQueue.
Min-Max堆的Java实现？(Java implementation for Min-Max Heap?)你知道一个流行的库（Apache，Google等等，集合），它有一个最小最大堆的可靠Java实现，这个堆允许查看O(1)最小值和最大值，并删除O(log n)的元素？
Do you know of a popular library (Apache, Google, etc, collections) which has a reliable Java implementation for a min-max heap, that is a heap which allows to peek its minimum and maximum value in O(1) and to remove an element in O(log n)?
最满意答案
来自Guava： MinMaxPriorityQueue 。
From Guava: MinMaxPriorityQueue.
发布评论