目录
对于指定的字符串,计算相同字符的数量,并将结果用HashMap存储,然后遍历
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
public class Test {
public static void main(String[] args) {
String randLetterInfo = "ajfoaifjalfajweoagaefalwfgjaoevawjaiwefjawoefiaf";
Test test = new Test();
test.countCharOfStr(randLetterInfo);
}
/**
* 计算特定字符的重复的次数数,并打印到控制台
*
* @param inputLetterInfo 字符串
*/
public void countCharOfStr(String inputLetterInfo) {
char[] letterCharArray = inputLetterInfo.toCharArray();
Map<Character, Integer> opMap = new HashMap<>();
for (char c : letterCharArray) {
opMap.put(c, opMap.get(c) == null ? 1 : opMap.get(c) + 1);
}
Iterator iter = opMap.keySet().iterator();
while (iter.hasNext()) {
char c = (Character) iter.next();
System.out.println(c + " = " + opMap.get(c));
}
}
}
运行结果如下:
a = 12 e = 5 f = 8 v = 1 w = 5 g = 2 i = 3 j = 6 l = 2 o = 4 |
版权声明:本文为u011159350原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。