思路:对于每一个单词,先存入数组,然后标准化(小写加排序)后的单词的计数值加1,最后输出数组中计数位1的单词即可。
version 1(自己写的版本):
#include<iostream>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 100000;
string words[maxn];
map<string,int>dict;
string mylower(string s){
for(int i = 0;i < s.size();i++)
if(s[i] < 'a') s[i] += 32;
sort(&s[0],&s[0] + s.size());
return s;
}
int main(){
string s,t;
int cnt = 0;
while(cin >> s && s[0] != '#'){
t = mylower(s);
words[cnt++] = s;
dict[t]++;
}
sort(words,words + cnt);
for(int i = 0;i < cnt;i++)
if(dict[mylower(words[i])] == 1){
cout<<words[i]<<endl;
}
return 0;
}
version 2(改成常引用,先找出单词后再排序):
#include<iostream>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
vector<string>words;
map<string,int>dict;
string sta(const string& s){
string ans = s;
for(int i = 0;i < s.size();i++)
if(ans[i] < 'a') ans[i] += 32;
sort(ans.begin(),ans.end());
return ans;
}
int main(){
string s;
while(cin >> s && s[0] != '#'){
words.push_back(s);
dict[sta(s)]++;
}
vector<string>ans;
for(int i = 0;i < words.size();i++)
if(dict[sta(words[i])] == 1) ans.push_back(words[i]);
sort(ans.begin(),ans.end());
for(int i = 0;i < ans.size();i++)
cout<<ans[i]<<endl;
return 0;
}