[LeetCode] Anagrams

vector<string> anagrams(vector<string> &strs) {map<string, int> hashTable;for (int i = 0; i < strs.size(); i++){string str = strs[i];sort(str.begin(), str.end());if (hashTable.count(str) == 0){hashTable[str] = 1;}else{hashTable[str]++;}}vector<string> anagrams; for (int i = 0; i < strs.size(); i++){string str = strs[i];sort(str.begin(), str.end());if (hashTable[str] > 1){anagrams.push_back(strs[i]);}}return anagrams;}