Package Cn.wang;
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.Map.Entry;
public class Wordfreq {
public static void Main (string[] args) {
String str = "Hello World My first Unit Test";
string[] items = Str.split ("");
map<string, integer> map = new hashmap<string, integer> ();
for (String S:items) {
if (Map.containskey (s))
Map.put (S, map.get (s) + 1);
else {
Map.put (S, 1);
}
}
list<entry<string, integer>> list = new arraylist<entry<string, integer>> ();
For (entry<string, integer> entry:map.entrySet ()) {
List.add (entry);
}
Collections.sort (list, new Entrycomparator ());
For (entry<string, integer> obj:list) {
System.out.println ("Word:" +obj.getkey () + "\ T" + "appears:" + obj.getvalue ());
}
}
}
Class Entrycomparator implements Comparator<entry<string, integer>> {
public int Compare (entry<string, integer> O1, entry<string, integer> O2) {
return O1.getvalue () > O2.getvalue ()? 0:1;
}
}
: Write a program that parses the frequency of occurrences of each word in a string and displays the word and the frequency at which it appears. (the words are separated by a space, such as "Hello World My First Unit Test").