遍歷
第一種:通過Map.keySet()遍歷key和value
Map<String, Object> map = new HashMap<String, Object>();
map.put("aaa", 111);
map.put("bbb", 222);
map.put("ccc", 333);
map.put("ddd", 444);
System.out.println("第一種:通過Map.keySet()遍歷key和value:");
//keySet獲取map集合key的集合 然後在遍歷key即可
for(String key:map.keySet()){
String value = map.get(key).toString();//
System.out.println("key:"+key+" vlaue:"+value);
}
第二種:通過Map.entrySet使用iterator遍歷key和value
Iterator<Entry<String, Object>> it = map.entrySet().iterator();
while(it.hasNext()){
Entry<String, Object> entry = it.next();
System.out.println("key:"+entry.getKey()+" key:"+entry.getValue());
}
第三種:通過Map.entrySet遍歷key和value ( 數據量大時推薦使用)
for (Map.Entry<String, Object> m : map.entrySet()) {
System.out.println("key:" + m.getKey() + " value:" + m.getValue());
}
第四種:通過Map.values()遍歷所有的value,但不能遍歷key
for(Object m:map.values()){
System.out.println(m);
}
排序
Map<String, String> tm=new TreeMap<String, String>();
tm.put("a", "ddd");
tm.put("b", "ccc");
tm.put("c", "bbb");
tm.put("d", "aaa");
//這裏將map.entrySet()轉換成list
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String,String>>(tm.entrySet());
//然後通過比較器來實現排序
Collections.sort(list,new Comparator<Map.Entry<String,String>>() {
//降序排序
@Override
public int compare(Entry<String, String> o1,
Entry<String, String> o2) {
return o2.getValue().compareTo(o1.getValue());
}
});
for(Map.Entry<String,String> mapping:list){
System.out.println(mapping.getKey()+":"+mapping.getValue());
}