Leetcode_anagrams

地址： http://oj.leetcode.com/problems/anagrams/

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

思路：求出调换了某些字母顺序的单词组合。用字典排序的单词做key，value存其sort前的单词。

参考代码：

class Solution {
public:
    vector<string> anagrams(vector<string> &strs) {
        vector<string>ans;
        map<string, vector<string> >dm;
        string idx;
        if(!strs.empty())
        {
            for(int i = 0; i<strs.size(); ++i)
            {
                idx = strs[i];
                sort(idx.begin(), idx.end());
                dm[idx].push_back(strs[i]);
            }
            for(auto it = dm.begin(); it != dm.end(); it++)
            {
                if(it->second.size()>1)
                {
                    ans.insert(ans.end(), it->second.begin(), it->second.end());
                }
            }
        }
        return ans;
    }
};