Выводит вроде все по коду, или я где то ошибся?
При проверке не проходит пункт сортировки!
import java.io.*;
import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new FileReader(new File(args[0])));
String line;
SortedMap<Character, Integer> repetitions = new TreeMap<>();
while ((line = reader.readLine()) != null) {
char[] chars = line.toCharArray();
for (int i = 0; i < chars.length; i++) {
char character = chars[i];
if (repetitions.containsKey(character)) {
repetitions.put(character, repetitions.get(character) + 1);
} else repetitions.put(character, 1);
}
}
reader.close();
for (Map.Entry e : repetitions.entrySet()) {
System.out.println(e.getKey() + " " + e.getValue());
}
}
}package com.javarush.task.task18.task1821;
/*
Встречаемость символов
*/
import java.io.*;
import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new FileReader(new File(args[0])));
String line;
SortedMap<Character, Integer> repetitions = new TreeMap<>();
while ((line = reader.readLine()) != null) {
char[] chars = line.toCharArray();
for (int i = 0; i < chars.length; i++) {
char character = chars[i];
if (repetitions.containsKey(character)) {
repetitions.put(character, repetitions.get(character) + 1);
} else repetitions.put(character, 1);
}
}
reader.close();
for(Map.Entry e: repetitions.entrySet()){
System.out.println(e.getKey()+" " + e.getValue());
}
}
}