LeetCode Anagrams

class Solution {
public:
    vector<string> anagrams(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function        
        vector<string> anagrams;
        int len = strs.size();
        
        if (len < 2) {
            return anagrams;
        }
        
        string key;
        map<string, vector<string> > dict;
        map<string, vector<string> >::iterator it;
        
        for (int i = 0; i < len; i++) {
            key = strs[i];
            sort(key.begin(), key.end());
            dict[key].push_back(strs[i]);
        }
        
        
        int len_second;
        for (it = dict.begin(); it != dict.end(); it++) {
            len_second = (*it).second.size();
            if (len_second > 1) {
                for (int j = 0; j < len_second; j++) {
                    anagrams.push_back((*it).second[j]);
                }
            }
        }
        
        return anagrams;
    }
};