UVa 156 Ananagrams 【STL】【map】

题目链接：点击打开链接

map的用法，参考紫书114页

AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
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()
{
    string s;
    while(cin >> s)//对输入的单词进行处理
    {
        if(s == "#") break;
        words.push_back(s);
        string r = repr(s);
        if(!cnt[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;
}