选择某种Map集合保存学号从1到15的学员的学号(键)和姓名(值),学号用字符串表示,输入的时候要以学号乱序的方式存入Map集合,然后按照学号从大到小的顺序将Map集合中的元素输出打印。需要自定义Map集合的比较器Comparator,因字符串对象的大小比较是按字典序,而非对应的数值。
要求:必须使用Map集合的内部排序机制进行排序,不能在外部排序。
##
package assembly;
import java.util.*;
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
TreeMap tm=new TreeMap(new MyComparator());
tm.put("1742110314","赵六");
tm.put("1742110311","张三");
tm.put("1742110303","孙小");
tm.put("1742110309","周清");
tm.put("1742110301","陈好");
tm.put("1742110302","吴梅");
//tm.put("1742110303","孙小");
tm.put("1742110304","文敬");
tm.put("1742110305","李超");
tm.put("1742110306","刘圆");
tm.put("1742110307","王新");
tm.put("1742110308","张雪");
//tm.put("1742110309","周清");
tm.put("1742110310","高晴");
//tm.put("1742110311","张三");
tm.put("1742110312","李四");
tm.put("1742110313","王五");
//tm.put("1742110314","赵六");
tm.put("1742110315","钱七");
//获取键的集合
Set keySet=tm.keySet();
//获取迭代器
Iterator it=keySet.iterator();
while(it.hasNext()){
Object key=it.next();
Object value=tm.get(key);
System.out.println(key+":"+value);
}
}
}
package assembly;
import java.util.*;
public class MyComparator implements Comparator{
public int compare(Object obj1,Object obj2){
String id1=(String)obj1;
String id2=(String)obj2;
return id2.compareTo(id1);
}
}