Java、求数组中大写字母的个数

package Recursive;

import java.util.Arrays;
import java.util.Scanner;

public class Exercise18_16 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter a list of chars: ");
        char[] chars = input.nextLine().toCharArray();

        System.out.println("The number of uppercase in char list " + Arrays.toString(chars) + " is " + count(chars));
    }

    /** 返回数组中大写字母的个数 */
    public static int count(char[] chars) {
        return count(chars, chars.length-1);
    }

    /** 返回数组中大写字母的个数辅助方法 */
    public static int count(char[] chars, int high) {
        int v = Character.isUpperCase(chars[high]) ? 1 : 0;
        return high == 0 ? v : (v + count(chars, high-1));
    }
}

---