anagrams 

 1 class Solution {
 2 public:
 3     vector<string> anagrams(vector<string> &strs) {
 4         vector<string> res;
 5         if (strs.size() <= 1) return res;
 6         map<string, int> anagram;
 7         for (int i = 0; i < strs.size(); ++i)
 8         {
 9             string s = strs[i];
10             sort(s.begin(), s.end());
11             if (anagram.find(s) == anagram.end()) {
12                 anagram[s] =  i;
13             } else {
14                 if (anagram[s] >= 0) {
15                     res.push_back(strs[anagram[s]]);
16                     anagram[s] = -1;
17                 }
18                 res.push_back(strs[i]);
19             }
20         }
21         return res;
22     }
23 };

 

posted on 2013-09-04 23:00  jumping_grass  阅读(130)  评论(0)    收藏  举报

导航