49. Group Anagrams (string, map)

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        if (strs.size() <= 0) return result;
        
        vector<vector<string>> result;
        map<string,int> anagram;
        int resIndex = 0;
        string s;
        
        for (int i = 0; i < strs.size(); ++i)
        {
            s = strs[i];
            sort(s.begin(), s.end()); //anagram无关乎字母顺序，所以将string按字母排序后再比较
            if (anagram.find(s) == anagram.end()) { //如果还没有出现过该anagram
                vector<string> item;
                item.push_back(strs[i]);
                result.push_back(item);
                anagram.insert(make_pair(s, resIndex++));
            } else {
                result[anagram[s]].push_back(strs[i]);
            }
        }
        
        //each inner list‘s elements must follow the lexicographic order
        for(int i = 0; i < result.size(); i++){
            sort(result[i].begin(), result[i].end());
        }
        return result;
    }
};