Heap-PriorityQueue

PriorityQueue를 통한 힙 구현

import java.util.PriorityQueue; 

//int형 priorityQueue 선언 (우선순위가 낮은 숫자 순)
PriorityQueue<Integer> priorityQueue = new PriorityQueue<>();

//int형 priorityQueue 선언 (우선순위가 높은 숫자 순)
PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(Collections.reverseOrder());

//String형 priorityQueue 선언 (우선순위가 낮은 숫자 순)
PriorityQueue<String> priorityQueue = new PriorityQueue<>(); 

//String형 priorityQueue 선언 (우선순위가 높은 숫자 순)
PriorityQueue<String> priorityQueue = new PriorityQueue<>(Collections.reverseOrder());


priorityQueue.add(1);  
priorityQueue.add(2);    
priorityQueue.offer(3);   

priorityQueue.poll(); 
priorityQueue.remove(); 
priorityQueue.clear();   

PriorityQueue<Integer> priorityQueue = new PriorityQueue<>();/
priorityQueue.offer(2);  
priorityQueue.offer(1);  
priorityQueue.offer(3); 
priorityQueue.peek();  

// Java program to iterate elements
// to a Queue

import java.util.*;
  
public class GFG {
  
    public static void main(String args[])
    {
        Queue<String> pq = new PriorityQueue<>();
  
        pq.add("Geeks");
        pq.add("For");
        pq.add("Geeks");
  
        Iterator iterator = pq.iterator();
  
        while (iterator.hasNext()) {
            System.out.print(iterator.next() + " ");
        }
    }
}

• Ref

  • https://coding-factory.tistory.com/602