anagrams c++ leetcode

this problem uses map;

1.map<string, int> anagrams; then we can use anagram[string] as an integer; of course we can also use the anagram[int] as string the string;

2.anagram[s] if < 0 , it means this one is already been used

3.if we cannot find anagram.find(s), it means this string has not been maped. then we give it a value of i;

4.if we find it and its value was i, it means we have one before,so that we should push_back both the str[anagrams[s]] and the current str[i]

Please see the details in code bellow.

class Solution {
public:
    vector<string> anagrams(vector<string> &strs) {
        string s;
        map<string,int> anagram;
        vector<string> res;
        for(int i = 0;i< strs.size();i++)
        {
            s = strs[i];
            sort(s.begin(),s.end());
            if(anagram.find(s) == anagram.end())
                anagram[s] = i;//把s映射到数字i
            else
            {
                if(anagram[s] >=0)
                {
                    res.push_back(strs[anagram[s]]);//如果当前数字上面是i》＝0
                    //那就得把这个数字代表的那个str放进去
                    anagram[s] = -1;
                }
                //如果找到了，但是小于0，证明当前位置上这个已经放进去了，我们要做的就是把
                //现在str［i］放进去就好啦
                res.push_back(strs[i]);
            }
        }
        return res;
    }
};