版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Lichengguang_std/article/details/81636287
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
while (cin >> s){
int cont[26] = { 0 };
for (int i = 0; i < s.size(); i++){
cont[s[i] - 'a']++;
}
int min = cont[s[0] - 'a'];
for (int i = 0; i < s.size(); i++){
if (cont[s[i] - 'a'] <= min){
min = cont[s[i] - 'a'];
}
}
for (int i = 0; i < s.size(); i++){
if (cont[s[i] - 'a']>min){
cout << s[i];
}
}
}
return 0;
}
这种字符串查找的思想很重要