★★ Java の宿題ここで答えます Part 63 ★★

in WordCounter#main(String[])

- for (Map.Entry<String, Integer> e : wc.count().entrySet()) {

+ TreeSet<Map.Entry<String, Integer>> set = new TreeSet<Map.Entry<String, Integer>>(
+ new Comparator<Map.Entry<String, Integer>>() {
+ public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
+ int c = o2.getValue().compareTo(o1.getValue());
+ return c == 0 ? o1.getKey().compareTo(o2.getKey()) : c;
+ }
+ }
+ );
+ set.addAll(wc.count().entrySet());
+ for (Map.Entry<String, Integer> e : set) {