Map的遍历
Map的排序
Map的遍历
Map<String, Integer> INPUTMAP = new HashMap<String, Integer>() {
{
put("a", 1);
put("c", 3);
put("b", 2);
put("d", 4);
put("e", 5);
}
};
Iterator it = INPUTMAP.entrySet().iterator();
while(it.hasNext()) {
Map.Entry entry = (Map.Entry)it.next();
Object key = entry.getKey();
Object value = entry.getValue();
}
Map的排序
Key的排序可以使用TreeMap,但是put和remove的时候由于需要排序,性能上会有所牺牲。使用时请权衡性能。
TreeMap<String, Integer> INPUTMAP = new TreeMap<String, Integer>() {
{
put("a", 1);
put("c", 3);
put("b", 2);
put("d", 4);
put("e", 5);
}
};
另一种方法是Collections.sort来排序,不仅适用Key,同样使用value的排序。
Map<String, Integer> INPUTMAP = new HashMap<String, Integer>() {
{
put("a", 1);
put("c", 3);
put("b", 2);
put("d", 4);
put("e", 5);
}
};
Iterator it = INPUTMAP.entrySet().iterator();
while(it.hasNext()) {
Map.Entry entry = (Map.Entry)it.next();
Object key = entry.getKey();
Object value = entry.getValue();
}
List<Map.Entry<String, Integer>> inputList = new ArrayList<Map.Entry<String, Integer>>(INPUTMAP.entrySet());
//排序
Collections.sort(inputList, new Comparator<Map.Entry<String, Integer>>() {
public int compare(Map.Entry<String, Integer> m1, Map.Entry<String, Integer> m2) {
return (m1.getValue().toString().compareTo(m2.getValue().toString()));
}
});
for(int i = 0; i < inputList.size(); i ++) {
Map.Entry<String, Integer> entry = inputList.get(i);
String key = entry.getKey();
Integer value = entry.getValue();
System.out.println("key:" + key + "\tvalue:" + value);
}