Advertisement
Advertisement
| 07.22.2008 at 08:00AM PDT, ID: 23585343 |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
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: |
import java.io.*;
import java.util.*;
public class WordFrequency {
public static void main(String[] args) throws IOException {
WordFrequency test = new WordFrequency();
test.countWordFre();
}
public void countWordFre() throws IOException {
Scanner in = new Scanner(new FileInputStream("in.txt"));
PrintWriter out = new PrintWriter(new FileOutputStream("out.txt"));
Hashtable map = new Hashtable();
String line = in.nextLine();
String word;
StringTokenizer st = new StringTokenizer(line);
while (st.hasMoreTokens()) {
word = st.nextToken().toLowerCase();
if (map.containsKey(word)) {
int count = (Integer) map.get(word);
map.put(word, count + 1);
} else {
map.put(word, 1);
}
}
word=in.nextLine();
Enumeration<String> e = map.keys();
while (e.hasMoreElements()) {
word =e.nextElement();
out.println(word + " " + map.get(word));
}
out.println(map.size());
out.println(map.isEmpty());
out.close();
}
}
|
