Vjudge题目链接,正如紫书所说,STL的威力在这道题得到了初步的体现。自己用了那么久的C++,最多就用过个string和vector,还需努力学习。
#include<cstdio>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string standard(const string str){//对输入变小写且排序
string ans = str;
for(int i = 0; i< ans.length(); i++)ans[i] = tolower(ans[i]);
sort(ans.begin(), ans.end());
return ans;
}
int main(){
string s;
map<string, int> mp;
vector<string> word;
while(cin>>s){
if(s[0] == '#')break;
word.push_back(s);
if(!mp.count(standard(s)))mp[standard(s)]=0;//map里没有输入串的标准化后的映射
mp[standard(s)]++;
}
vector<string> ans;
for(int i = 0; i < word.size(); i++){
if(mp[standard(word[i])]==1)ans.push_back(word[i]);
}
sort(ans.begin(), ans.end());
for(int i = 0; i < ans.size(); i++)
cout<<ans[i]<<endl;
return 0;
}