通過循環遍歷字符串，然後壹個個的比較，記下相同字符的個數就行了。代碼如下：
import?java.util.Scanner;import?java.util.TreeMap;
/**
*?從鍵盤輸入16位長整數,編程統計每個數字出現的個數 *?@author?young * */public?class?CharMapDemo?{
//?統計數字或者字符出現的次數
public?static?TreeMap<Character,?Integer>?Pross(String?str)?{
char[]?charArray?=?str.toCharArray();
TreeMap<Character,?Integer>?tm?=?new?TreeMap<Character,?Integer>();
for?(int?x?=?0;?x?<?charArray.length;?x++)?{
if?(!tm.containsKey(charArray[x]))?{
tm.put(charArray[x],?1);
}?else?{
int?count?=?tm.get(charArray[x])?+?1;
tm.put(charArray[x],?count);
}
}
return?tm;
}
public?static?void?main(String[]?args)?{
Scanner?sc?=?new?Scanner(System.in);
// System.out.println("請輸入壹個長整數：");
// int?temp?=?sc.nextInt();
// String?str?=?String.valueOf(temp);
// TreeMap<Character,?Integer>?tm?=?Pross(str);
// System.out.println(tm);
System.out.println("請輸入壹個字符串：");
String?str?=?sc.nextLine();
TreeMap<Character,?Integer>?tm?=?Pross(str);
System.out.println(tm);
}
}