Anagrams

 1 class Solution {
 2 public:
 3     typedef unordered_map<string, int> UMP;
 4     
 5 public:
 6     vector<string> anagrams(vector<string> &strs) {
 7         UMP htable;
 8         vector<string> ans;
 9         for(int i=0; i<strs.size(); ++i) {
10             string str = strs[i];
11             sort(str.begin(), str.end());   //排序单词，认为其字典排序为其原型
12             UMP::iterator iter = htable.find(str);  //在哈希表中查找其原型
13             if( iter == htable.end() ) {    //找不着，就在哈希表中添加其原型
14                 htable.insert( make_pair(str, i) );
15             }
16             else {  //找到
17                 if( iter->second != -1 ) {  //如果结果中没有输出推导出原型的单词，则输出
18                     ans.push_back(strs[iter->second]);
19                     iter->second = -1;
20                 }
21                 ans.push_back(strs[i]); //哈希表中有原型，则输出该单词
22             }
23         }
24         return ans;
25     }
26 };