统计文本中每个字符出现的次数 --Java

import org.junit.jupiter.api.Test;

import java.io.*;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;

/**
 * @author czt
 * @date 2021/3/13-21:36
 **/
public class CharacterCountTest {
    @Test
    public void characterCountTest1() {
        BufferedReader br = null;
        BufferedWriter bw = null;
        try {
            Map<Character, Integer> map = new LinkedHashMap<>();
            FileReader fr = new FileReader("hello.txt");
            br = new BufferedReader(fr);
            FileWriter fw = new FileWriter("Count.txt");
            bw = new BufferedWriter(fw);
            int data;
            while ((data = br.read()) != -1) {
                char ch = (char) data;
                if (map.get(ch) == null) {
                    map.put(ch, 1);
                } else {
                    map.put(ch, map.get(ch) + 1);
                }
            }
            Set<Map.Entry<Character, Integer>> entries = map.entrySet();
            for (Map.Entry<Character, Integer> entry : entries) {
                switch (entry.getKey()) {
                    case ' ':
                        bw.write("空 : " + entry.getValue());
                        break;
                    case '\t':
                        bw.write("tab : " + entry.getValue());
                        break;
                    case '\r':
                        bw.write("回 : " + entry.getValue());
                        break;
                    case '\n':
                        bw.write("换 : " + entry.getValue());
                        break;
                    default:
                        bw.write(entry.getKey() + " :" + entry.getValue());
                        break;
                }
                bw.newLine();
            }
        } catch (IOException e) {
            System.out.println(e.getMessage());
        } finally {
            if (br != null) {
                try {
                    br.close();
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            if (bw != null){
                try {
                    bw.close();
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
        }
    }
}