3615. 单词个数统计

3615. 单词个数统计

⭐️难度：简单
⭐️类型：字符串

📖题目：题目链接

📚题解：

#include<stdio.h>#include<iostream>#include<map>usingnamespacestd;intmain(){// This is An Pencil Casechararr[2000]={0};fgets(arr,2000,stdin);inti=0;intalphaCount=0;boolisSpace=true;intwordCount=0;map<char,int>alphaMap;while(true){if(arr[i]=='\0'||arr[i]=='\n'){break;}elseif(arr[i]==' '){isSpace=true;}else{++alphaCount;if(isSpace){++wordCount;}if(arr[i]>='A'&&arr[i]<='Z'){// ASCIIarr[i]+=32;}++alphaMap[arr[i]];isSpace=false;}++i;}printf("%d\n",alphaCount);printf("%d\n",wordCount);map<char,int>::iterator it;intmaxTimes=0;for(it=alphaMap.begin();it!=alphaMap.end();++it){if(it->second>maxTimes){maxTimes=it->second;}}for(it=alphaMap.begin();it!=alphaMap.end();++it){if(it->second==maxTimes){printf("%c ",it->first);}}printf("\n");printf("%d\n",maxTimes);// cin.getline()return0;}