package interview;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
public class FindNum {
public static void main(String[] args) {
String s = "dddsdgfsdf";
getCalcuate(s);
getCalcuate2(s);
}
public static void getCalcuate2(String s) {
// TODO Auto-generated method stub
ArrayList<String> list = new ArrayList<String>();
//把数组存到链表
for(int i=0;i<s.length();i++)
{
list.add(s.charAt(i)+"");//char转成string
}
int[] count = new int[list.size()];
//排序
Collections.sort(list);
for(int t=0;t<count.length;t++)
count[t] = 1;
for(int i=0;i<list.size();i++)
for(int j=i+1;j<list.size();j++){
if(list.get(i).equals(list.get(j))){
list.remove(j);
j--;
count[i]++;
}
}
System.out.println(list);
System.out.println(Arrays.toString(count));
int max=0;
String maxStr = "";
for(int t=0;t<count.length;t++){
if(max<count[t])
{
max = count[t];
maxStr = list.get(t);
System.out.println("maxStr:"+maxStr);
}
}
System.out.println("最多字母:"+maxStr+" Num:"+max);
}
public static void getCalcuate(String s) {
// TODO Auto-generated method stub
int[] count = new int[127];
//用ASCII码值作为数组索引
for(int i=0;i<s.length();i++)
{
int c = s.charAt(i);
count[c]++;
}
int max= count[0];
int maxStr= 0;
for(int j=1;j<count.length;j++){
if(max < count[j])
{ max = count[j];
maxStr = j;
}
}
System.out.println("最多字母:"+(char)maxStr+" Num:"+max);
}
}