案例 二

第三题：需求实现

    * 模拟在一副牌中，抽取第1张，第5张，第50张扑克牌

public class Test3 {
    public static void main(String[] args){
        String pai[]=getPai();
        int num1=1;
        int num2=5;
        int num3=50;
        String pai3[]=get3(pai,num1,num2,num3);
        for (int i=0;i<pai3.length;i++){
            System.out.print(pai3[i]+" ");
        }
    }
    private static String[] getPai(){
        String huase[]={"黑桃","红桃","梅花","方块"};
        String dianshu[]={"A","2","3","4", "5","6","7","8","9","10","J","Q","K"};
        String pai[]=new String[54];
        int z=0;
        for (int x=0;x<huase.length;x++){
            for (int y=0;y<dianshu.length;y++){
                pai[z]=huase[x]+dianshu[y];
                z++;
            }
        }
        pai[52]="小王";
        pai[53]="大王";
        return pai;

    }
    public static String[] get3(String[] pai,int a1,int a2,int a3){
        String pai3[]=new String[3];
        pai3[0]=pai[a1-1];
        pai3[1]=pai[a2-1];
        pai3[2]=pai[a3-1];
        return pai3;
    }
}

第四题：需求实现

    * 统计字符
    * 字符数组：{'a','l','f','m','f','o','b','b','s','n'}
    * 定义printCount方法，统计每个字符出现的次数并打印到控制台
    * 将数字强制转换，根据ASCII码表转换为字符
    * 可以定义长度26的数组，每个元素，对应去保存每种字符的出现次数，比如0索引保存a的次数，1索引保存b的次数，以此类推

public class Test4 {
    public static void main(String[] args){
        char shuzu[]={'a','l','f','m','f','o','b','b','s','n'};
        printCount(shuzu);
    }
    public static void printCount(char shuzu[]){
        int count[]=new int[26];
        for (int i=0;i<shuzu.length;i++){
            int j=shuzu[i];
            count[j-97]++;
        }
        for (int i=0,j=97;i<count.length;i++,j++){
            if (count[i]!=0){
                System.out.println((char)j+" "+count[i]);
            }
        }
    }
}