Case03:统计字母出现的次数

package com.atguigu.java;

/**
 * @author hylstart
 * @create 2021-12-29 22:31
 */
public class code02 {
    public static void main(String[] args) {
        char[] arr1 = new char[]{'a', 'g', 'f', 'y', 'd', 'o', 'p', 'n', 'm', 's'};

        int[] arr2 = new int[26];

        //用数组2记录数组1中出现的字符的次数
        for (char c: arr1){
            arr2[c - 'a']++;
        }

        //对数组2进行输出
        for (int i = 0; i < arr2.length; i++){
            if (arr2[i] > 0)
                System.out.println((char)(i + 'a') + ":" + arr2[i]);
        }
    }
}