LeetCode Anagrams

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

思路：对于每个字符串都排序后，用map标记是否已经加入到答案中。

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

        return ans;
    }
};

LeetCode Anagrams

原文：http://blog.csdn.net/u011345136/article/details/44134489