代码如下 TreeMap<String, Integer> map = new TreeMap<>(); Random random = new Random(); for (int i = 0; i < 100000; i++) { //创建随机数作为key Integer i1 = random.nextInt(100000) + 100000; String s = i1.toString(); map.put(s, random.nextInt(1000)); } //将数加入到集合中,因为TreeMap是只能关于key的数值大小过着字典前后排序的 ArrayList<Map.Entry<String, Integer>> entries = new ArrayList<>(map.entrySet()); //使用工具类进行排序 Collections.sort(entries, new Comparator<Map.Entry<String, Integer>>() { @Override public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) { //降序 return o2.getValue().compareTo(o1.getValue()); } }); Iterator<Map.Entry<String, Integer>> iterator = entries.iterator(); for (int i = 0; i < 100; i++) { if (iterator.hasNext()) { System.out.println(iterator.next().getKey() + "----->" + iterator.next().getValue()); } }