сортирует подсчитывает все символы
public class Solution {
public static void main(String[] args) throws IOException {
ArrayList<Character> chars = new ArrayList();
BufferedReader bf = new BufferedReader(new FileReader(args[0]));
int b=0;
while ((b=bf.read())!=-1)
chars.add((char)b);
bf.close();
TreeMap<Character,Integer> hashMap =new TreeMap();
for (Character ch:chars){
if (hashMap.containsKey(ch))hashMap.put(ch,hashMap.get(ch)+1);
if (!hashMap.containsKey(ch))hashMap.put(ch,1);
}
hashMap.forEach((k, v) -> System.out.printf("%s %d \n", k, v));
}
}package com.javarush.task.task18.task1821;
import java.io.*;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.TreeMap;
/*
Встречаемость символов
*/
public class Solution {
public static void main(String[] args) throws IOException {
ArrayList<Character> chars = new ArrayList();
BufferedReader bf = new BufferedReader(new FileReader(args[0]));
int b=0;
while ((b=bf.read())!=-1)
chars.add((char)b);
bf.close();
TreeMap<Character,Integer> hashMap =new TreeMap();
int count=0;
for (Character ch:chars){
if (!hashMap.containsKey(ch))hashMap.put(ch,0);
if (hashMap.containsKey(ch))hashMap.put(ch,hashMap.get(ch)+1);
}
hashMap.forEach((k, v) -> System.out.printf("%s %d \n", k, v));
// write your code here
}
}