【算法竞赛入门经典第五章：C++与STL入门

5.2.3集合set

#include<iostream>
#include<string>
#include<set>
#include<sstream>
using namespace std;

set<string> dict;

int main(){
string s,buf;
while(cin >> s){
for(int i=0;i<s.length();i++)
if(isalpha(s[i]))
s[i]=tolower(s[i]);
else
s[i]=' ';
stringstream ss(s);
while(ss>>buf)
dict.insert(buf);
}
for(set<string>::iterator it =dict.begin();it != dict.end();it++)
cout<<*it<<endl;
return 0;
}

5.2.4：映射：map

#include<iostream>
#include<string>
#include<cctype>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;

map<string,int> cnt;
vector<string> words;

string repr(const string &s){
string ans = s;
for(int i=0;i<ans.length();i++)
ans[i]=tolower(ans[i]);
sort(ans.begin(),ans.end());
return ans;
}

int main(){
int n=0;
string s;
while(cin>>s){
if(s[0]=='#')    break;
words.push_back(s);
string r=repr(s);
if(!cnt.count(r))    cnt[r]=0;
cnt[r]++;
}
vector<string> ans;
for(int i=0;i<words.size();i++)
if(cnt[repr(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;
}