fork download
copy 
  1. import java.io.BufferedReader;
  2. import java.io.IOException;
  3. import java.io.InputStreamReader;
  4. import java.util.Map;
  5. import java.util.HashMap;
  6.  
  7. public class Main {
  8.     private static boolean isLetter(char c) {
  9.         return ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z');
  10.     }
  11.  
  12.     private static void increaseFrequency(Map<StringBuilder, Integer> words, StringBuilder currentWord) {
  13.         if (words.containsKey(currentWord)) {
  14.             words.put(currentWord, words.get(currentWord) + 1);
  15.         } else {
  16.             words.put(currentWord, 1);
  17.         }
  18.     }
  19.  
  20.     private static boolean isMoreFrequent(String currentWord, String recurrentWord, int currentOcurance, int maxOcurance) {
  21.         return (currentOcurance > maxOcurance) || (currentOcurance == maxOcurance && (recurrentWord == null || recurrentWord.compareTo(currentWord) > 0));
  22.     }
  23.  
  24.     public static String frequestWord(BufferedReader reader) throws IOException {
  25.         Map<StringBuilder, Integer> words = new HashMap<>();
  26.         String recurrentWord = null;
  27.         int maxOcurance = 0;
  28.         while (reader.ready()) {
  29.             String currentLine = reader.readLine();
  30.             StringBuilder currentWord = new StringBuilder();
  31.             boolean wasLetter = false;
  32.             int length = currentLine.length();
  33.             for (int i = 0; i < length; ++i) {
  34.                 if (isLetter(currentLine.charAt(i))) {
  35.                     currentWord.append(currentLine.charAt(i));
  36.                     wasLetter = true;
  37.                 } else if (wasLetter) {
  38.                     increaseFrequency(words, currentWord);
  39.                     if (isMoreFrequent(currentWord.toString(), recurrentWord, words.get(currentWord), maxOcurance)) {
  40.                         recurrentWord = currentWord.toString();
  41.                         maxOcurance = words.get(currentWord);
  42.  
  43.                     }
  44.                     currentWord = new StringBuilder();
  45.                     wasLetter = false;
  46.                 }
  47.             }
  48.             if (currentWord.length() > 0) {
  49.                 increaseFrequency(words, currentWord);
  50.                 if (isMoreFrequent(currentWord.toString(), recurrentWord, words.get(currentWord), maxOcurance)) {
  51.                     recurrentWord = currentWord.toString();
  52.                     maxOcurance = words.get(currentWord);
  53.                 }
  54.             }
  55.         }
  56.         return recurrentWord;
  57.     }
  58.  
  59.     public static void main(String[] args) throws IOException {
  60.         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
  61.         System.out.println(frequestWord(reader));
  62.     }
  63. }
Success #stdin #stdout 0.09s 52956KB
comments (?)
stdin
copy 
mersi pentru lista de instructiuni
e de ajutor
mersi
stdout
copy 
ajutor
https://ideone.com/XjNhTM
language:
Java (HotSpot 12)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!