Java 排行榜功能实现方法：TreeMap 与 PriorityQueue

实现 Java 排行榜功能可以使用 Java 集合类中的 TreeMap 或者 PriorityQueue。\n\n1. 使用 TreeMap：TreeMap 是一个有序的键值对集合，可以根据键的自然顺序或者自定义的比较器进行排序。可以将排行榜中的元素作为键，分数作为值存储在 TreeMap 中。通过比较分数来进行排序，可以使用自定义的比较器或者实现 Comparable 接口来指定排序规则。\n\njava\nimport java.util.Comparator;\nimport java.util.TreeMap;\n\npublic class RankingBoard {\n private TreeMap<String, Integer> leaderboard;\n\n public RankingBoard() {\n leaderboard = new TreeMap<>(new ScoreComparator());\n }\n\n public void addPlayer(String player, int score) {\n leaderboard.put(player, score);\n }\n\n public void removePlayer(String player) {\n leaderboard.remove(player);\n }\n\n public void updateScore(String player, int score) {\n leaderboard.put(player, score);\n }\n\n public void printRankings() {\n int rank = 1;\n for (String player : leaderboard.keySet()) {\n System.out.println(rank + ". " + player + ": " + leaderboard.get(player));\n rank++;\n }\n }\n\n private static class ScoreComparator implements Comparator<String> {\n @Override\n public int compare(String player1, String player2) {\n int score1 = leaderboard.get(player1);\n int score2 = leaderboard.get(player2);\n // 根据分数降序排序\n return Integer.compare(score2, score1);\n }\n }\n}\n\n\n2. 使用 PriorityQueue：PriorityQueue 是一个优先队列，可以根据元素的优先级进行排序。可以将排行榜中的元素封装为一个包含玩家名字和分数的对象，并实现 Comparable 接口来指定排序规则。\n\njava\nimport java.util.Comparator;\nimport java.util.PriorityQueue;\n\npublic class RankingBoard {\n private PriorityQueue<Player> leaderboard;\n\n public RankingBoard() {\n leaderboard = new PriorityQueue<>(new ScoreComparator());\n }\n\n public void addPlayer(String player, int score) {\n leaderboard.offer(new Player(player, score));\n }\n\n public void removePlayer(String player) {\n leaderboard.removeIf(p -> p.getName().equals(player));\n }\n\n public void updateScore(String player, int score) {\n leaderboard.removeIf(p -> p.getName().equals(player));\n leaderboard.offer(new Player(player, score));\n }\n\n public void printRankings() {\n int rank = 1;\n while (!leaderboard.isEmpty()) {\n Player player = leaderboard.poll();\n System.out.println(rank + ". " + player.getName() + ": " + player.getScore());\n rank++;\n }\n }\n\n private static class Player implements Comparable<Player> {\n private String name;\n private int score;\n\n public Player(String name, int score) {\n this.name = name;\n this.score = score;\n }\n\n public String getName() {\n return name;\n }\n\n public int getScore() {\n return score;\n }\n\n @Override\n public int compareTo(Player other) {\n // 根据分数降序排序\n return Integer.compare(other.score, this.score);\n }\n }\n\n private static class ScoreComparator implements Comparator<Player> {\n @Override\n public int compare(Player player1, Player player2) {\n // 根据分数降序排序\n return Integer.compare(player2.getScore(), player1.getScore());\n }\n }\n}\n\n\n以上是两种实现 Java 排行榜功能的方法，具体的实现可以根据需求进行调整。