Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.FileNotFoundException;
- import java.util.*;
- public class MapCount {
- public static void main(String[] args) {
- Scanner input = new Scanner(System.in);
- String key = "";
- int key2 = 0;
- int T = 0;
- int K = 0;
- boolean i = true;
- int parsedLines = 0;
- int failedParsedLines = 0;
- String nextLine = "";
- Map<Integer, Integer> map = new TreeMap<>();
- try{
- System.out.print("Please enter a text name: ");
- String f = input.nextLine();
- java.io.File file = new java.io.File(f);
- String path = file.getPath();
- Scanner scan = new Scanner(file);
- if (i = true){
- while (scan.hasNextLine()) {
- try {
- nextLine = scan.nextLine();
- key = nextLine;
- key2 = Integer.parseInt(key);
- if (!map.containsKey(key2))
- map.put(key2, 1);
- else
- map.put(key2, map.get(key2) + 1);
- Integer ii = Integer.parseInt(nextLine);
- parsedLines++;
- T = T + ii;
- K++;
- }
- catch(NumberFormatException ex){
- System.out.println("Cannot parse string as integer: " + nextLine);
- failedParsedLines++;
- }
- }
- }
- }
- catch(FileNotFoundException ex){
- System.out.print("File not found.");
- System.exit(1);
- }
- int O = T / K;
- System.out.println("Number of parsable lines: " + parsedLines);
- System.out.println("Number of unparsable lines: " + failedParsedLines);
- System.out.println("Average value: " + O);
- int k = Collections.max(map.values());
- for(Map.Entry<Integer, Integer> entry : map.entrySet()){
- if (entry.getValue() == k){
- System.out.print(entry.getKey() + " ");
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement