10.31



PriorityQueue<Map.Entry<String, Integer>> pq = new PriorityQueue<>((a, b) ->
b.getValue().compareTo(a.getValue()));

for (Map.Entry<String, Integer> entry : wordCountMap.entrySet()) {
pq.offer(entry);
}
Scanner scanner = new Scanner(System.in);
System.out.print("请输入前N个单词的数量:");
int n = scanner.nextInt();
BufferedWriter writer = new BufferedWriter(new FileWriter(outputFilePath));
for (int i = 0; i < n && !pq.isEmpty(); i++) {
Map.Entry<String, Integer> entry = pq.poll();
String word = entry.getKey();
int count = entry.getValue();
System.out.println("Word: " + word + ", Count: " + count);
writer.write("Word: " + word + ", Count: " + count);
writer.newLine();
}
writer.close();
reader.close();
} catch (IOException e) {
e.printStackTrace();
}
}
}
并进行了javaweb的增删改查的学习
posted @ 2023-11-13 20:58  new菜鸟  阅读(20)  评论(0)    收藏  举报