1 class Solution { 2 public: 3     vector<string> anagrams(vector<string> &strs) { 4         vector<string> res; 5         map<string, vector<string> > rec; 6         if (strs.size() == 0) return res; 7          8         for (string s : strs) { 9             string ts(s);10             sort(ts.begin(), ts.end());11             rec[ts].push_back(s);12         }13         14         for (auto map : rec) {15             if (map.second.size() > 1)16                 res.insert(res.end(), map.second.begin(), map.second.end());17         }18         19         return res;20     }21 };