LeetCode 49: Anagrams

Difficulty: 3

Frequency: 4

Problem:

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

Note: All inputs will be in lower-case.

Solution:

class Solution {public:    vector<string> anagrams(vector<string> &strs) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        vector <string> answer;        if (strs.size()<=1)            return answer;                    map <string, int> anas;                for (int i = 0; i<strs.size(); i++)        {            string s = strs[i];            sort(s.begin(), s.end());            if (anas.find(s)==anas.end())            {                anas[s] = i;            }            else            {                if (anas[s]>=0)                {                    answer.push_back(strs[anas[s]]);                    anas[s] = -1;                }                answer.push_back(strs[i]);            }        }        return answer;    }};

Notes:

This not my code. It is AnnieKim's code. Thank her very much for publishing her code.