import java.util.Comparator; import java.util.PriorityQueue; public class G { public static void main(String[] args) { Comparator<Integer> com = new Comparator<Integer>() { @Override public int compare(Integer o1, Integer o2) { return o1-o2; } }; PriorityQueue<Integer> pq = new PriorityQueue<>(com); pq.add(2); pq.add(1); pq.add(-1); pq.poll(); System.out.println(pq); } }
import java.util.Iterator; import java.util.SortedSet; import java.util.TreeSet; public class H { public static void main(String[] args) { SortedSet<Integer> ss = new TreeSet<>((o1,o2)-> { return o1-o2; }); ss.add(2); ss.add(1); //默认从小到大 Iterator<Integer> it = ss.iterator(); while(it.hasNext()) { System.out.println(it.next()); } } }
原文:https://www.cnblogs.com/godoforange/p/11210572.html