1 Star 0 Fork 0

CS-IMIS-23/20172314

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
LetterCount.java 1.64 KB
一键复制 编辑 原始数据 按行查看 历史
//*************************************************************************************
// LetterCount.java Author: Lewis/Loftus
//
// Demonstrates the relationship between arrays an strings.
//*************************************************************************************
import java.util.Scanner;
public class LetterCount
{
//-----------------------------------------------------------------------------------
// Reads a sentence from the user and counts the number of uppercase and lowercase
// letters contained in it.
//-----------------------------------------------------------------------------------
public static void main(String[] args)
{
final int NUMCHARS = 26;
Scanner scan = new Scanner(System.in);
int[] upper = new int[NUMCHARS];
int[] lower = new int[NUMCHARS];
char current; // the current character being processed
int other = 0; // counter for non-alphabetics
System.out.println("Enter a sentence:");
String line = scan.nextLine();
// Count the number of each letter occurrence
for (int ch = 0; ch < line.length(); ch++)
{
current = line.charAt(ch);
if (current >= 'A' && current <= 'Z')
upper[current-'A']++;
else
if (current >= 'a' && current <= 'z')
lower[current-'a']++;
else
other++;
}
// Print the results
System.out.println();
for (int letter=0; letter < upper.length; letter++)
{
System.out.print((char)(letter + 'A'));
System.out.print(": " + upper[letter]);
System.out.print("\t\t" + (char)(letter + 'a'));
System.out.println(": " + lower[letter]);
}
System.out.println();
System.out.println("Non-alphabetic characters: " + other);
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/CS-IMIS-23/20172314.git
git@gitee.com:CS-IMIS-23/20172314.git
CS-IMIS-23
20172314
20172314
master

搜索帮助