【LeetCode】Anagrams

class Solution {public:    vector<string> anagrams(vector<string> &strs) {        vector<string> result;map<string,vector<string>> store;int i;for(i=0;i<strs.size();i++){string temp;temp=strs[i];sort(temp.begin(),temp.end());store[temp].push_back(strs[i]);}map<string,vector<string>>::iterator iter;for(iter=store.begin();iter!=store.end();iter++){if(iter->second.size()>1){result.insert(result.end(),iter->second.begin(),iter->second.end());}}return result;    }};