// 키에 따른 오름차순 탐색
Iterator<String> keyIterator = new TreeMap<>(map).keySet().iterator();
while (keyIterator.hasNext()) {
String key = keyIterator.next();
int value = map.get(key);
System.out.println(key + " : " + value);
}
// 값에 따른 내림차순 탐색
List<Map.Entry<String, Integer>> entryList = new ArrayList<>(map.entrySet());
entryList.sort(Collections.reverseOrder(Map.Entry.comparingByValue()));
Iterator<Map.Entry<String, Integer>> valueIterator = entryList.iterator();
while (valueIterator.hasNext()) {
Map.Entry<String, Integer> entry = valueIterator.next();
String key = entry.getKey();
int value = entry.getValue();
System.out.println(key + " : " + value);
}
댓글