java中（优先队列）PriorityQueue的使用

import java.util.*;


public class test1 {
 
	public static void PrintPr(Queue
   queue){
		while(queue.peek()!=null){
			System.out.print(queue.remove()+" ");
		}
		System.out.println();
	}
	public static void main(String[] args) {
		PriorityQueue
  
    priorityQueue=new PriorityQueue
   
    (); //优先级队列存放整型数字 Random random=new Random(47); for(int i=0;i<10;i++){ priorityQueue.offer(random.nextInt(i+10)); } PrintPr(priorityQueue); //// List
    
      ints=Arrays.asList(25,22,20,18,14,9,3,1,1,2,3,9,2,5,1,5,25,30,0,10); priorityQueue.addAll(ints); PrintPr(priorityQueue); priorityQueue=new PriorityQueue
     
      (ints.size(),Collections.reverseOrder()); priorityQueue.addAll(ints); PrintPr(priorityQueue); //优先级队列存放字符 String fact="UDJKKDJL WSAPLMAD IUJSAA ATHSHJ"; List
      
        list=Arrays.asList(fact.split("")); PriorityQueue
       
         priorityQueueStrings=new PriorityQueue
        
         (list); PrintPr(priorityQueueStrings); priorityQueueStrings=new PriorityQueue
         
          (list.size(),Collections.reverseOrder()); priorityQueueStrings.addAll(list); PrintPr(priorityQueueStrings); //set去重在排序 Set
          
            set=new HashSet
           
            (); for(char c:fact.toCharArray()){ set.add(c); } PriorityQueue
            
              pQCharacters=new PriorityQueue
             
              (set); PrintPr(pQCharacters); } } 
             
            
           
          
         
        
       
      
     
    
   
  

结果：

0 1 1 1 1 1 3 5 8 14 
0 1 1 1 2 2 3 3 5 5 9 9 10 14 18 20 22 25 25 30 
30 25 25 22 20 18 14 10 9 9 5 5 3 3 2 2 1 1 1 0 
       A A A A A D D D H H I J J J J K K L L M P S S S T U U W 
W U U T S S S P M L L K K J J J J I H H D D D A A A A A        
  A D H I J K L M P S T U W