统计一个文件中各个字母出现的次数

public class Test {

	public static void main(String[] args) {
		// 声明字缓冲输入流
		BufferedReader br = null;
		try {
			// 创建字缓冲输入流对象
			br = new BufferedReader(new FileReader("D:\\a.txt"));
			String line = null;
			int count = 0;
			while ((line = br.readLine()) != null) {// 判断是否为最后一行
				char[] c = line.toCharArray();
				// 创建一个HashMap集合
				Map<Character, Integer> map = new HashMap<>();
				// 遍历数组，将字母及字母出现的次数存在集合中
				for (char d : c) {
					Integer num = map.get(d);
					map.put(d, num == null ? 1 : num + 1);
				}
				// 将HashMap集合的Key-value存到Set集合中
				Set<Entry<Character, Integer>> s = map.entrySet();
				// 迭代集合
				Iterator<Entry<Character, Integer>> it = s.iterator();
				while (it.hasNext()) {
					Map.Entry<Character, Integer> entry = (Entry<Character, Integer>) it.next();
					System.out.println(entry.getKey() + "(" + entry.getValue() + ")");
				}
			}
		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			// 关流
			try {
				if (br != null) {
					br.close();
				}
			} catch (Exception e2) {
				e2.printStackTrace();
			}
		}
	}
}