黑马程序员_获取字符串 字母出现的次数

尝试了下TreeMap<Character,String> 而不是Treemap<character,Integer> 顺便用了一下正则

import java.util.*;

import java.util.regex.*;
class  practice15
{
public static void main(String[] args) 
{
String str="eruodsfjlkslkjeoi";
System.out.println(change(str));
}
public static String change(String str)
{
char[] b=str.toCharArray();
TreeMap<Character,String> ts=new TreeMap<Character,String>();
for(int x=0;x<b.length;x++)
{
int count=1;
if(ts.get(b[x])==null)
{
System.out.println("---");
ts.put(b[x],"("+count+")");
}
else{
Pattern p=Pattern.compile("\\d+");
Matcher m=p.matcher(ts.get(b[x]));
while(m.find())
count=Integer.parseInt(m.group());
ts.put(b[x],"("+(++count)+")");}
}
StringBuffer sb=new StringBuffer();
Set<Character> set=ts.keySet();
for(Character ch:set)
{
sb.append(ch+ts.get(ch));
}
return sb.toString();

}
}