package com.huaxin.test;
public class Frequency {
public static void main(String[] args) {
String str = "sdfsadgsdfsdfgi";
int length = str.length();
char[] S = str.toCharArray(); //将str各个字符串存进字符数组S中
char[] A = new char[length]; //存放不相同的字符
int[] C = new int[length]; //存放各个字符个数
A[0] = S[0]; //A[0]存放S首个字符
C[0] = 1; //str中首个字符出现的次数
int k = 1; //数组A中最后一个未存放字符的数组下标
for(int i = 1; i < length; i++) {
C[i] = 0;
}
for(int i =1; i < length; i++) {
int j = 0;
while(j < k && A[j] != S[i]) {
j++;
}
//j == k时表示str的字符首次出现
if(j == k) {
A[k] = S[i];
C[k]++;
k++;
//str的字符已经在C存放过,次数加1
} else {
C[j]++;
}
}
for(int i = 0; i < length; i++) {
if(C[i] != 0) {
System.out.println(A[i] + "出现" + C[i] + "次");
}
}
}
}