两个方法:读取txt文件转为String,在将map输出为txt并按value降序排序
发布日期:2021-06-29 15:58:37 浏览次数:2 分类:技术文章

本文共 1540 字,大约阅读时间需要 5 分钟。

public static void saveFileItemsToTxt(Map
map) {
//对map进行排序 //转换为list List
> list = new ArrayList
>(map.entrySet()); Collections.sort(list, new Comparator
>() { @Override public int compare(Map.Entry
o1, Map.Entry
o2) { return o2.getValue().compareTo(o1.getValue()); } }); System.out.println(list); OutputStreamWriter outFile = null; FileOutputStream fileOutputStream; String strItems = null; try { fileOutputStream = new FileOutputStream(outputPath); outFile = new OutputStreamWriter(fileOutputStream); for (int i = 0; i < list.size(); i++) { strItems = list.get(i).getKey() + ":" + list.get(i).getValue()+"\r\n"; System.out.println(strItems); outFile.write(strItems); } } catch (FileNotFoundException fileNotFoundException) { fileNotFoundException.printStackTrace(); } catch (IOException ioException) { ioException.printStackTrace(); } finally { try { outFile.flush(); outFile.close(); } catch (IOException e) { e.printStackTrace(); } } } public static String readTxt(String filePath) { String context = ""; try { File file = new File(filePath); if (file.isFile() && file.exists()) { InputStreamReader isr = new InputStreamReader(new FileInputStream(file), "utf-8"); BufferedReader br = new BufferedReader(isr); String lineTxt; while ((lineTxt = br.readLine()) != null) { System.out.println(lineTxt); context += lineTxt; } br.close(); } else { System.out.println("文件不存在!"); } } catch (Exception e) { System.out.println("文件读取错误!"); } return context; } ```

转载地址:https://suprit.blog.csdn.net/article/details/115920250 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:Leetcode 1360:日期之间隔几天(超详细的解法!!!)
下一篇:Leetcode 1359:有效的快递序列数目(超详细的解法!!!)

发表评论

最新留言

路过按个爪印,很不错,赞一个!
[***.219.124.196]2024年04月04日 15时47分48秒