选择某种Map集合保存学号从1到15的学员的学号(键)和姓名(值),学号用字符串表示,输入的时候要以学号乱序的方式存入Map集合,然后按照学号从大到小的顺序将Map集合中的元素输出打印。需要自定义Map集合的比较器Comparator,因字符串对象的大小比较是按字典序,而非对应的数值。
要求:必须使用Map集合的内部排序机制进行排序,不能在外部排序。
代码如下:
import java.util.Comparator;
import java.util.Iterator;
import java.util.Set;
import java.util.TreeMap;
public class test2 {
public static void main(String[] args) {
TreeMap map = new TreeMap(new MComparator());
map.put("05","He");
map.put("03","En");
map.put("12","Hello");
map.put("04","Admin");
map.put("06","BBc");
map.put("01","Lucy");
map.put("11","Boy");
map.put("08","Girl");
map.put("15","Jim");
map.put("09","Linda");
map.put("02","Andim");
map.put("10","Liu");
map.put("14","Zhang");
map.put("13","Wang");
map.put("07","Ye");
Set keySet=map.keySet();
Iterator it=keySet.iterator();
while(it.hasNext()) {
Object key=it.next();
Object value=map.get(key);
System.out.println(key+" "+value);
}
} }
class MComparator implements Comparator {
public int compare(Object obj1, Object obj2) {
String ele1 = (String) obj1;
String ele2 = (String) obj2;
return ele2.compareTo(ele1);
}
}
运行效果图: