![b7d9011faf24597ebb48e91c8a51f5c4.png](https://i-blog.csdnimg.cn/blog_migrate/fc32bceebe5887c6629b65bf4c3ad1ff.jpeg)
#include<stdio.h>
typedef struct {
char data;
int weight;
}Letter;
typedef struct{
Letter letters[100];
int length;
}Weight;
int main()
{
char ch[10000];
Weight W;
W.length=0;
int flag=0;
printf("请输入一段英文文章:n");
gets(ch);
for(int i=0;ch[i]!='0';i++)
{
for(int j=0;j<W.length;j++)
{
if(ch[i]==W.letters[j].data)
{
W.letters[j].weight++;
flag=1;
}
}
if(flag==0)
{
W.length++;
W.letters[W.length-1].data=ch[i];
W.letters[W.length-1].weight++;
}
flag=0;
}
printf("文章各字符出现的次数:n");
for(int j=0;j<W.length;j++)
{
printf("%c :%d次n",W.letters[j].data,W.letters[j].weight);
}
return 0;
}