题目链接:次数差 解题思路:统计每个字母出现的次数,找出最大和最小即可 #include<bits/stdc++.h> #define x first #define y second #define mem1(h) memset(h,-1,sizeof h) #define mem0(h) memset(h,0,sizeof h) #define mcp(a,b) memcpy(a,b,sizeof b) using namespace std; typedef long long LL; typedef unsigned long long ull; typedef pair<int,int>PII; typedef pair<double,double>PDD; namespace IO{ inline LL read(){ LL o=0,f=1;char c=getchar(); while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){o=o*10+c-'0';c=getchar();} return o*f; } }using namespace IO; //#############以上是自定义技巧(可忽略)########## const int N=1e3+7,M=2e5+7,INF=0x3f3f3f3f,mod=1e8+7,P=131; string s; int cnt[27]; int main(){ cin>>s; for(int i=0;i<s.size();i++){ cnt[s[i]-'a']++; } int maxv=0,minv=1007; for(int i=0;i<26;i++){ if(cnt[i]){ maxv=max(maxv,cnt[i]); minv=min(minv,cnt[i]); } } cout<<maxv-minv<<endl; return 0; }