易忘复习1-9的遍历与回文数方法改进

1.给定数组scores = {0,0,1,2,3,5,4,5,2,8,7,6,9,5,4,8,3,1,0,2,4,8,7,9,5,2,1,2,3,9}，找出其中0-9的个数并输出；
public void test1() {
    int[] scores = {0,0,1,2,3,5,4,5,2,8,7,6,9,5,4,8,3,1,0,2,4,8,7,9,5,2,1,2,3,9};
    int[] counts = new int[10];
    for (int i = 0; i < scores.length; i++) {
        counts[scores[i]]++;
        }
    for (int i = 0; i < counts.length; i++) {
        System.out.println(counts[i]);
    }
}

2.判断回文数
public void test78() {
    char[] array = {'a' , 'b', 'c',  'b' , 'a'};
    // 初始认为是回文
    boolean isHuiWen = true;
    for (int i = 0; i < array.length / 2; i++) {
        if (array[i] != array[array.length - i -1]) {
            // 只要找到一个不符合回文的要求，就可以判断不是回文，后面也不需要判断了
            isHuiWen = false;
            break;
        }
    }

    /*if (isHuiWen) {
        System.out.println("是回文");
    } else {
        System.out.println("不是回文");
    }*/
    // 三目运算符 如果boolean类型的值是true，就执行代码1，else 执行代码2
    // boolean ? 代码1 : 代码2;
    // isHuiWen ? System.out.println("是回文") : System.out.println("不是回文");
    System.out.println(isHuiWen ? "是回文数" : "不是回文数");
}