package com.practice_1;
import java.util.HashSet;
//"bcdabcdeaababca",获取字符串中每一个字母出现的次数要求结果:a(5)b(4)c(3)d(2)e(1)
public class TreeSetDemo {
public static void main(String[] args) {
//定义一个字符串
String s = "bcdabcdeaababca";
//将字符串转为字符数组
char[] ch = s.toCharArray();
//用HashSet集合统计字符串中出现的字符种类
//定义一个HashSet集合
HashSet<Character> hs = new HashSet<Character>();
for (int i = 0; i < ch.length; i++) {
hs.add(ch[i]);
}
//统计每个字符出现的次数
for (Character character : hs) {
int count = 0;
System.out.print(character);
for (int i = 0; i < ch.length; i++) {
if(character==ch[i]){
count++;
}
}
System.out.print("("+count+")");
}
}
}
import java.util.HashSet;
//"bcdabcdeaababca",获取字符串中每一个字母出现的次数要求结果:a(5)b(4)c(3)d(2)e(1)
public class TreeSetDemo {
public static void main(String[] args) {
//定义一个字符串
String s = "bcdabcdeaababca";
//将字符串转为字符数组
char[] ch = s.toCharArray();
//用HashSet集合统计字符串中出现的字符种类
//定义一个HashSet集合
HashSet<Character> hs = new HashSet<Character>();
for (int i = 0; i < ch.length; i++) {
hs.add(ch[i]);
}
//统计每个字符出现的次数
for (Character character : hs) {
int count = 0;
System.out.print(character);
for (int i = 0; i < ch.length; i++) {
if(character==ch[i]){
count++;
}
}
System.out.print("("+count+")");
}
}
}