Coś co napisałem kupę czasu temu, ale działa:
/*
* Decompiled with CFR 0_118.
*/
package text;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
public class CountLetters {
HashMap<Character, Integer> countLetters(String msg) {
HashMap<Character, Integer> letters = new HashMap<Character, Integer>();
char[] message = msg.toCharArray();
int i = 0;
while (i < msg.length()) {
Character letter = Character.valueOf(message[i]);
if (letters.containsKey(letter)) {
letters.put(letter, letters.get(letter) + 1);
} else {
letters.put(letter, 1);
}
++i;
}
return letters;
}
HashMap<Character, Integer> countLetters(String msg, HashMap<Character, Integer> letters) {
char[] message = msg.toCharArray();
int i = 0;
while (i < msg.length()) {
Character letter = Character.valueOf(message[i]);
if (letters.containsKey(letter)) {
letters.put(letter, letters.get(letter) + 1);
} else {
letters.put(letter, 1);
}
++i;
}
return letters;
}
Map<Character, Integer> sortMap(Map<Character, Integer> map) {
TreeMap<Character, Integer> sortedMap = new TreeMap<Character, Integer>(map);
return sortedMap;
}
void printMap(Map<Character, Integer> map) {
for (Map.Entry<Character, Integer> entry : map.entrySet()) {
System.out.println("Character: " + entry.getKey() + " occurs " + entry.getValue() + " times");
}
}
}
Sorki, że zdekompilowane, ale nie mogłem znaleźć source
chyba już gdzieś poleciało w siną dal :P
Za to dorzucam jara