java 优先队列（2017-06-19）

Posted 2021-05-08

package bearcola.queue.priorityqueue;

import java.util.PriorityQueue;

public class Main {

	public static void main(String[] args) {
		int[] input = new int[]{5, 4, 3, 7, 9};
		
		sort(input);
		
		for (int item: input) {
			System.out.println(item);
		}
	}
	
	public static void sort(int[] a) {
		PriorityQueue<Integer> q = new PriorityQueue<Integer>();
		
		for (int e: a) {
			q.add(e);
		}
		
		for (int k=0; k<a.length; k++) {
			a[k] = q.poll();
		}
	}

}