Write a program to find maximum repeated words from a file.

Description:

Write a program to read words from a file. Count the repeated or duplicated words. Sort it by maximum repeated or duplicated word count.

Code:

? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 package com.govindsblog.algos;   import java.io.BufferedReader; import java.io.DataInputStream; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.util.StringTokenizer; import java.util.Map.Entry;   public class MaxDuplicateWordCount {           public Map<String, Integer> getWordCount(String fileName){           FileInputStream fis = null;         DataInputStream dis = null;         BufferedReader br = null;         Map<String, Integer> wordMap = new HashMap<String, Integer>();         try {             fis = new FileInputStream(fileName);             dis = new DataInputStream(fis);             br = new BufferedReader(new InputStreamReader(dis));             String line = null;             while((line = br.readLine()) != null){                 StringTokenizer st = new StringTokenizer(line, " ");                 while(st.hasMoreTokens()){                     String tmp = st.nextToken().toLowerCase();                     if(wordMap.containsKey(tmp)){                         wordMap.put(tmp, wordMap.get(tmp)+1);                     } else {                         wordMap.put(tmp, 1);                     }                 }             }         } catch (FileNotFoundException e) {             e.printStackTrace();         } catch (IOException e) {             e.printStackTrace();         } finally{             try{if(br != null) br.close();}catch(Exception ex){}         }         return wordMap;     }           public List<Entry<String, Integer>> sortByValue(Map<String, Integer> wordMap){                   Set<Entry<String, Integer>> set = wordMap.entrySet();         List<Entry<String, Integer>> list = new ArrayList<Entry<String, Integer>>(set);         Collections.sort( list, new Comparator<Map.Entry<String, Integer>>()         {             public int compare( Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2 )             {                 return (o2.getValue()).compareTo( o1.getValue() );             }         } );         return list;     }           public static void main(String a[]){         MaxDuplicateWordCount mdc = new MaxDuplicateWordCount();         Map<String, Integer> wordMap = mdc.getWordCount("C:/MyTestFile.txt");         List<Entry<String, Integer>> list = mdc.sortByValue(wordMap);         for(Map.Entry<String, Integer> entry:list){             System.out.println(entry.getKey()+" ==== "+entry.getValue());         }     } }

Output:

one ==== 3 the ==== 3 that ==== 3 of ==== 2 in ==== 2 some ==== 2 to ==== 1 summary ==== 1 but ==== 1 have ==== 1 common ==== 1 least ==== 1 simplest ==== 1