1-14 统计输入单词中字符出现次数

#include <stdio.h>

#define MAXLETTERCOUNT 26
#define MAXNUMCOUNT 9

int letter[MAXLETTERCOUNT];
int number[MAXNUMCOUNT];

int main(int argc, char **argv) {
    char c;
    while ((c = getchar()) != EOF) {
        if ('A' <= c && c <= 'Z') {
            ++letter[c - 'A'];
        } else if ('a' <= c && c <= 'z') {
            ++letter[c - 'a'];
        } else if ('0' <= c && c <= '9') {
            ++number[c - '0'];
        }
    }

    for (int i = 0; i < MAXLETTERCOUNT; ++i) {
        char startLetter = 'A';
        printf("Letter %c: ", startLetter + i);
        for (int j = 0; j < letter[i]; ++j) {
            printf("*");
        }
        printf("\n");
    }

    for (int i = 0; i < MAXNUMCOUNT; ++i) {
        char startNumber = '0';
        printf("Number %c: ", startNumber + i);
        for (int j = 0; j < number[i]; ++j) {
            printf("*");
        }
        printf("\n");
    }
    
    printf("\n");
    return 0;
}

Test

abcdeaa112345234 df;d
Letter A: ***
Letter B: *
Letter C: *
Letter D: ***
Letter E: *
Letter F: *
Letter G: 
Letter H: 
Letter I: 
Letter J: 
Letter K: 
Letter L: 
Letter M: 
Letter N: 
Letter O: 
Letter P: 
Letter Q: 
Letter R: 
Letter S: 
Letter T: 
Letter U: 
Letter V: 
Letter W: 
Letter X: 
Letter Y: 
Letter Z: 
Number 0: 
Number 1: **
Number 2: **
Number 3: **
Number 4: **
Number 5: *
Number 6: 
Number 7: 
Number 8: 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值