#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        vector<vector<string>>ans;
        map<string, int>mp;
        for(int i = 0; i < (int)strs.size(); ++i) {
            string str = strs[i];
            sort(str.begin(), str.end());
            if(!mp[str]) {
                mp[str] = ans.size() + 1;
                ans.push_back(vector<string>());
                ans.back().push_back(strs[i]);
            } else {
                ans[mp[str] - 1].push_back(strs[i]);
            }
        }
        return ans;
    }
};

/**
 * 测试数据
 */
vector<string> test() {
    vector<string>strs;
    strs.push_back("eat");
    strs.push_back("tea");
    strs.push_back("tan");
    strs.push_back("ate");
    strs.push_back("nat");
    strs.push_back("bat");
    return strs;
}

int main()
{
    vector<string> strs = test();

    Solution obj;
    vector<vector<string>> ans = obj.groupAnagrams(strs);

    //输出
    for(int i = 0; i < (int)ans.size(); ++i) {
        for(int j = 0; j < (int)ans[i].size(); ++j) {
            cout<<ans[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}