uva 156 - Ananagrams

思路：

1.先读取单词，把单词都整齐一下，从大写变为小写

2.把单词按字母进行排序

3.判断接下来的单词和前面的单词是否重复

#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<algorithm>
using namespace std;
vector<string> newwords;
vector<int>    num;
vector<string> oldwords;
int main(){
    string l;
    vector<string>::iterator it;
    while(getline(cin,l)){
        if(l[0]=='#')
            break;
        istringstream iss(l);
        for(string temp;iss>>temp;){
            string oldtemp=temp;
            
            for(int i=0;i<temp.size();i++)
                if(isupper(temp[i]))
                    temp[i]+=32;
            for(int i=0;i<temp.size();i++){
                for(int j=0;j<temp.size();j++){
                    if(temp[i]<temp[j]){
                        char c=temp[i];
                        temp[i]=temp[j];
                        temp[j]=c;
                    }
                }
            }
            it=find(newwords.begin(),newwords.end(),temp);
            if(it==newwords.end()){
                newwords.push_back(temp);
                num.push_back(1);
                oldwords.push_back(oldtemp);
            }
            else{
                num[it-newwords.begin()]++;
            }

        }    
    }
    newwords.clear();
    it=oldwords.begin();
    for(int i=0;i<num.size();i++,it++){
        if(num[i]==1){
            newwords.push_back(*it);
        }
    }
    sort(newwords.begin(),newwords.end());
    for(int i=0;i<newwords.size();i++)
        cout<<newwords[i]<<endl;
    //system("pause");
}