//核心算法.利用HashMap的特性HashMap<key,values>中key用来
//保存字符,value保存字符出现的次数,最后遍历输出.如abcdabcd,则输出[a=2,b=2 c=3 d=2]
for(char c:str.toCharArray()){
if(map.containsKey(c)){//当HashMap包含字符时更新value即可(利用不可存储重复)
Integer ad= map.get(c);
ad++;
map.put(c, ad);
}else {//当HashMap未包含字符时会自动存储
map.put(c, 1);
}
}
`
```java
遍历输出.
for(Character key:map.keySet())
{
Integer value= map.get(key);
System.out.println(key+"="+value);
}
//Set<Character>ad=map.keySet();
// Iterator<Character>pdd=ad.iterator();
// while(pdd.hasNext()) {
//Character key=pdd.next();
//Integer value=map.get(key);
//System.out.println(key+" "+value);
```clike
Scanner scanner=new Scanner(System.in);
System.out.println("请输入一个一个字符串");
String str=scanner.next();
``` HashMap<Character, Integer>map=new HashMap<>();