7-2 实验9_3_字母统计 (100分)

最新推荐文章于 2023-11-21 08:00:00 发布

ChaoYue_miku

最新推荐文章于 2023-11-21 08:00:00 发布

阅读量1.4k

点赞数 1

分类专栏： PTA

本文链接：https://blog.csdn.net/ChaoYue_miku/article/details/112951754

版权

PTA 专栏收录该内容

149 篇文章 75 订阅

订阅专栏

7-2 实验9_3_字母统计 (100分)
任意给定一个字符串，字符串中包含除了空格、换行符之外的的任意字符。你的任务是统计出现在该字符串中的各字母（即“A—Z”，“a—z”）的个数(区分大小写)。

输入格式:
一个长度不超过100的非空字符串。字符串中不会出现空格、换行符。

输出格式:
字符串中出现的字母的统计信息，每个字母的统计信息占一行，按照字母的ASCII码的顺序输出。。

输入样例:
AAAsdf&^%DF879as
输出样例:
注意单词“time”不论单复数，一律输出复数形式“times”

The character A has presented 3 times.
The character D has presented 1 times.
The character F has presented 1 times.
The character a has presented 1 times.
The character d has presented 1 times.
The character f has presented 1 times.
The character s has presented 2 times.

#include<stdio.h>
#include<string.h>
int main()
{
	char ch[100], st;
	int a[100] = { 0 }, b[100] = { 0 };
	int count1 = 0, count2 = 0, count3 = 0, count4 = 0, i = 0, j;
	scanf("%s",ch);
	while (ch[i] != 0)
	{
		if (ch[i] >= 'a'&&ch[i] <= 'z')
		{
			count1 = ch[i] - 'a';
			a[count1]++;

		}
		if (ch[i] >= 'A'&&ch[i] <= 'Z')
		{
			count2 = ch[i] - 'A';

			b[count2]++;
		}
		i++;
	}
 
	for (j = 0; j <= 25; j++)
	{
		if (b[j] != 0)
			printf("The character %c has presented %d times.\n", (char)('A' + j), b[j]);
	}
	for (j = 0; j <= 25; j++)
	{
		if (a[j] != 0)
			printf("The character %c has presented %d times.\n", (char)('a' + j), a[j]);
	}
	return 0;
}