文章目录
排序map&&数组排序
public static void main(String[] args) {
TreeMap<Integer, Integer> treeMap = new TreeMap<>(Comparator.reverseOrder());
treeMap.put(1,8);
treeMap.put(6,9);
treeMap.put(3,2);
treeMap.put(15,12);
System.out.println(treeMap.firstEntry().getKey()+":"+treeMap.firstEntry().getValue());
System.out.println(treeMap.lastEntry().getKey()+":"+ treeMap.lastEntry().getValue());
System.out.println(treeMap.floorKey(9)); //返回小于且最接近key的键(包含等于)
System.out.println(treeMap.higherKey(9));//返回最接近的大于key的键
System.out.println(treeMap.lowerKey(9)); //返回小于且最接近key的键(不包含等于) :
System.out.println(treeMap.pollFirstEntry());
ArrayList<Integer> arrayList = new ArrayList<>();
//LinkedList<Integer>arrs=new LinkedList<>();//双端队列
arrayList.add(1);
arrayList.add(6);
arrayList.add(3);
Collections.sort(arrayList,Collections.reverseOrder());
System.out.println(arrayList);
}
执行结果
15:12
1:8
15
6
15
15=12
[6, 3, 1]