java小程序..docxVIP

字符统计输入一行字符，分别统计出包含英文字母、空格、数字和其它字符的个数。importjava.util.Scanner;publicclass Main{publicstaticintgetEnglishCharCount(String str){ intlen = str.length() , num1=0;for(int a = 0 ; a len ; a++){ if((str.charAt(a) = a str.charAt(a) = z) || (str.charAt(a) = A str.charAt(a) = Z))num1++;}return num1; }publicstaticintgetBlankCharCount(String str) { intlen = str.length() , num2=0;for(int a = 0 ; a len ; a++){if(str.charAt(a) == )num2++; }return num2; }publicstaticintgetNumberCharCount(String str) { intlen = str.length() , num3=0;for(int a = 0 ; a len ; a++){if(str.charAt(a) = (char) 0 str.charAt(a) = (char) 9)num3++; }return num3; }publicstaticvoid main(String[]args){ Scanner scan = newScanner(System.in); String s=scan.nextLine();if (s.isEmpty()) {System.out.println(0 + + 0 + + 0 + + 0); } else { int a=getEnglishCharCount(s);int b=getBlankCharCount(s);int c=getNumberCharCount(s);int d = s.length() - a - b - c ;System.out.println(a);System.out.println(b);System.out.println(c);System.out.println(d); } }}计算输入名字的漂亮度给出一个名字，该名字有26个字符串组成，定义这个字符串的“漂亮度”是其所有字母“漂亮度”的总和。每个字母都有一个“漂亮度”，范围在1到26之间。没有任何两个字母拥有相同的“漂亮度”。字母忽略大小写。给出多个名字，计算每个名字最大可能的“漂亮度”。importjava.util.Scanner;importjava.util.HashMap;importjava.util.Arrays;publicfinalclass Main{//restore count by charprivatestaticHashMapCharacter, Integer charCntMap = newHashMapCharacter, Integer();//26个字母，不区分大小写privatestaticfinalintCHAR_SIZE = 26;//publicstaticvoid main(String[] args){Scanner scanner = newScanner(System.in);//略过第一行输入name总数scanner.nextLine();//假设输入正确，即第一行name总数与后续输入names总数数相符合String name = null;while(scanner.hasNextLine()){name = scanner.nextLine();System.out.println(maxNameScore(name));}scanner.close();}/** * 计算name最大分数 * @param name * @return */privatestaticintmaxNameScore(String name){intmaxScore = 0;charCntMap.clear();char[] charsName = name.toCharArray(); for(inti = 0; i charsName.length; i++){charopChar = Character.toLowerCase(charsName[i]);