UVA 156 Ananagrams

把每个单词“标准化“，即全部转化为小写再排序，然后放到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[r])
            cnt[r] = 0;
        cnt[r]++;
    }
    vector<string> ans;
    for (int i = 0; i < words.size(); i++)
    {
        if (cnt[repr(words[i])] == 1)//重复度为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;
}