要求:必须使用Map集合的内部排序机制进行排序,不能在外部排序。
import java.util.Comparator;
import java.util.Map;
import java.util.TreeMap;
public class MapTest {
public static void main(String[] args) {
TreeMap<String, String> map=new TreeMap<String, String>();
map.put("1103","张三"); //学号乱序添加元素
map.put("1102","李四");
map.put("1113","王五");
map.put("1115","刘芳");
map.put("1102","王伟");
map.put("1101","李刚");
map.put("1104","杨国富");
map.put("1106","肯德基");
map.put("1105","麦当劳");
map.put("1109","德克士");
map.put("1107","必胜客");
map.put("1112","华莱士");
map.put("1111","迪斯尼");
map.put("1108","方特");
map.put("1114","金宝");
map.put("1110","富华");
Map<String, String> resultMap = sortMapByKey(map); //按Key值排序
for(Map.Entry<String, String> entry : resultMap.entrySet()) {
System.out.println(entry.getKey() + " " + entry.getValue());
}
}
//使用Map按Key值进行排序
public static Map<String, String> sortMapByKey(Map<String, String> map) {
if (map == null || map.isEmpty()) {
return null;
}
Map<String, String> sortMap = new TreeMap<String, String>(new MapKeyComparator());
sortMap.putAll(map);
return sortMap;
}
}
//比较器类
class MapKeyComparator implements Comparator<String>{
@Override
public int compare(String o1, String o2) {
return o1.compareTo(o2);
}
}