UVa-156 Ananagrams(map映射)

参考：https://blog.csdn.net/hoaresky1998/article/details/51351588

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
map<string,int> ma;
set<string> sea;
string change(string x)
{
    for (unsigned int i=0;i<x.length();i++)
    {
       x[i]=towlower(x[i]);
    }
    sort(x.begin(),x.end());//排序string类型的方法
    return x;
}
int main()
{
//    freopen("in.txt","r",stdin);
    string s;
    while (cin>>s)
    {
        if (s=="#")
        {
            break;
        }
        sea.insert(s);//运用set自身的有序性
        string temp=change(s);//转化为小写形式，且字母按字典序排序
        if (!ma.count(temp))
        {
            ma[temp]=1;
        }
        else
        {
            ma[temp]++;
        }
    }
    set<string>::iterator it;
    for (it=sea.begin();it!=sea.end();it++)
    {
        if (ma[change(*it)]==1)
        {
            cout<<*it<<endl;
        }
    }

    return 0;
}