优先级队列PriorityQueue 测试,会自动排序
package com.eos.wool.test2; import java.util.*; /** * Created by CLP on 2020-06-17. */ public class PriorityQueueTest { public static List<Integer> insertSort() { Queue<Integer> queue = new PriorityQueue<Integer>(12); List<Integer> list = new ArrayList<Integer>(); Random random = new Random(); int aa; for (int i = 0; i < 17; i++) { aa=random.nextInt(100); System.out.println(aa); queue.add(new Integer(aa)); } while(!queue.isEmpty()){ list.add(queue.poll()); } //左右输出 个数不全;因为poll一次就会删除,所以size会变化,和list一般需要逆序删除一样。 // for (int i = 0; i < queue.size(); i++) { // list.add(queue.poll()); // } System.out.println(list.toString()); return list; } public static void main(String[] args){ System.out.println(Arrays.toString(insertSort().toArray())); } }