Leetcode's anagrams (35)

Palindrome word-formation, the alphabetical order is disrupted. The letters can be reordered and, if they are equal, belong to the same set of anagrams.

It can be done by HashMap, with the sorted letters as key. Note the following procedure when HASHMAP values are taken.

vector<string> anagrams (vector<string> &STRs) {Unordered_map<string, vector<string>>Group;  for(ConstAuto &s:strs) {              stringKey =s;              Sort (Key.begin (), Key.end ());          Group[key].push_back (s); } Vector<string>result;  for(Auto it = Group.cbegin (); It! = Group.cend (); it++)          {              //Insert , inserting an element before Result.end (), returning an iterator to the element              if(It->second.size () >1) Result.insert (Result.end (), it->second.begin (), it->second.end ()); }          returnresult; }

View Code

Leetcode's anagrams (35)