public class S14{
public static void main(String[] args){
TreeMap<Integer,String> test = new TreeMap<>();
test.put(3,"java");
test.put(2,"up");
test.put(1,"down");
test.put(4,"php");
test.put(6,"put");
test.putIfAbsent(5,"js");
System.out.println(test);
}
}
public class S14{
public static void main(String[] args){
TreeMap<Integer,String> test = new TreeMap<>((a,b->b-a));
test.put(3,"java");
test.put(2,"up");
test.put(1,"down");
test.put(4,"php");
test.put(6,"put");
test.putIfAbsent(5,"js");
System.out.println(test);
}
}
正序结果
倒序结果
TreeMap会自动排好序