题解 | 字母统计
字母统计
https://www.nowcoder.com/practice/de7bf0945c1c4bd1aa9d49573b831f3c
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
struct azSeq {
char zimu;
int cishu;
};
int main() {
vector<azSeq> azseq(30);
for (int i = 0; i < 26; ++i) {
azseq[i].zimu = 'A' + i;
azseq[i].cishu = 0;
}
string shuru;
char arr[100];
scanf("%s", &arr);
shuru = arr;
for (int i = 0; i < shuru.size(); ++i) {
if (shuru[i] >= 'A' && shuru[i] <= 'Z') {
for (int j = 0; j < 26; ++j) {
if (azseq[j].zimu == shuru[i]) {
++azseq[j].cishu;
break;
}
}
}
}
for (int j = 0; j < 26; ++j) {
printf("%c:%d\n", azseq[j].zimu, azseq[j].cishu);
}
return 0;
}
#pieceofshit##shit#
查看14道真题和解析
投递谷歌等公司10个岗位 >