---------------------------HashMap集合的遍歷 /第一種 package ji_he;import java.util.*;public class Example16 {public static void main(String[] args) {// TODO Auto-generated method stubMap map=new HashMap();map.put(1, "Jack");map.put(2, "Rose");map.put(3, "Lucy");map.put(3, "Lucy");Set kSet=map.keySet();//獲取鍵集合Iterator iterator=kSet.iterator();while (iterator.hasNext()) {Object key = iterator.next();Object value=map.get(key);System.out.println(key+":"+value);}}} ///第二種 package ji_he;import java.util.*;public class Example17 {public static void main(String[] args) {// TODO Auto-generated method stubHashMap map=new HashMap();map.put("1", "Jack");map.put("2", "Rose");map.put("3", "Lucy");map.put("3", "Lucy");Set entrySet=map.entrySet();Iterator iterator=entrySet.iterator();//獲取Iterator對(duì)象while (iterator.hasNext()) {Map.Entry entry=(Map.Entry) (iterator.next());//獲取集合中鍵值對(duì)的映射關(guān)系Object key = entry.getKey();//獲取Entry的鍵值Object value=entry.getValue();System.out.println(key+":"+value);}}} -------------------------------------TreeMap集合 ///TreeMap集合的遍歷 package ji_he;import java.util.*;public class Example20 {public static void main(String[] args) {// TODO Auto-generated method stubTreeMap tMap=new TreeMap();tMap.put("1", "Jack");tMap.put("2", "Rose");tMap.put("3", "Lucy");Set kSet=tMap.keySet();Iterator iterator=kSet.iterator();while (iterator.hasNext()) {Object key = (Object) iterator.next();Object values=tMap.get(key);System.out.println(key+":"+values);}}} //TreeMap集合自定義比較器package top.wthfeng.hello;import java.util.Comparator; import java.util.Map; import java.util.TreeMap;public class Map2Test{public static void main(String[]args){Map<String,String> map = new TreeMap<>(new Comparator<String>(){public int compare(String o1,String o2){return o2.compareTo(o1); //用正負(fù)表示大小值}});//以上4行可用下面一行l(wèi)ambda表達(dá)式代替//Map<String,String> map1 = new TreeMap<>((o1,o2)->o2.compareTo(o1));map.put("zdef","rfgh");map.put("asrg","zfg");map.put("rgd","dfgh");map.put("cbf","gddf");for(Map.Entry<String,String> entry:map.entrySet()){System.out.println("key:"+entry.getKey()+",:value:"+entry.getValue()); }} } //輸出結(jié)果（倒序）： key:zdef,:value:rfgh key:rgd,:value:dfgh key:cbf,:value:gddf key:asrg,:value:zfg

總結(jié)

以上是生活随笔為你收集整理的HashMap集合和TreeMap集合的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。