版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/huanghanqian/article/details/73433760
PrioriryQueue是Queue接口的一个队列实现类,但它的排序并不是典型的队列式先进先出(FIFO)的方式。
PriorityQueue的排序方式分为两种,一种是自然排序,这是按照加入元素的大小从小到大排序的。第二种是定制排序,是使用comparator类来重写compare(Object o1,Object o2)方法来实现定制排序的。但是这些都不是关键,关键在于PriorityQueue的排序不是普通的排序,而是堆排序,这有什么不同呢?来看下面一段代码:
import java.util.PriorityQueue;
public class PriorityQueueTest3
{
public static void main(String[] args)
{
PriorityQueue pq = new PriorityQueue();
pq.offer(6);
pq.offer(-3);
pq.offer(0);
pq.offer(9);
System.out.println(pq);
}
}
输出结果:[-3,6,0,9]
不是说是按从小到大来排序的吗?怎么没排序?
原因是堆排序只会保证第一个元素也就是根节点的元素是当前优先队列里最小(或者最大)的元素,而且每一次变化之后,比如offer()或者poll()之后,都会进行堆重排,所以如果想要按从小到大的顺序取出元素,那么需要用一个for循环,如下:
import java.util.PriorityQueue;
public class PriorityQueueTest3
{
public static void main(String[] args)
{
PriorityQueue pq = new PriorityQueue();
pq.offer(6);
pq.offer(-3);
pq.offer(0);
pq.offer(9);
int len = pq.size();//这里之所以取出.size()大小,因为每一次poll()之后size大小都会变化,所以不能作为for循环的判断条件
for(int i=0;i<len;i++){
System.out.print(pq.poll()+" ");
}
System.out.println();
}
}
输出 -3 0 6 9,按照从小到大的顺序输出的
该篇转载自http://blog.csdn.net/cyp331203/article/details/25310733
另外:看API:http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html
Constructor Detail
-
PriorityQueue
public PriorityQueue()
Creates a
PriorityQueue
with the default initial capacity (11) that orders its elements according to their natural ordering.
-
PriorityQueue
public PriorityQueue(int initialCapacity)
Creates a
PriorityQueue
with the specified initial capacity that orders its elements according to their natural ordering.Parameters:
initialCapacity
- the initial capacity for this priority queueThrows:
IllegalArgumentException
- ifinitialCapacity
is less than 1
-
PriorityQueue
public PriorityQueue(int initialCapacity, Comparator<? super E> comparator)
Creates a
PriorityQueue
with the specified initial capacity that orders its elements according to the specified comparator.Parameters:
initialCapacity
- the initial capacity for this priority queuecomparator
- the comparator that will be used to order this priority queue. Ifnull
, the natural ordering of the elements will be used.Throws:
IllegalArgumentException
- ifinitialCapacity
is less than 1