-
Notifications
You must be signed in to change notification settings - Fork 0
/
Anagrams.cpp
34 lines (30 loc) · 1.16 KB
/
Anagrams.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// https://oj.leetcode.com/problems/anagrams/
class Solution {
public:
vector<string> anagrams(vector<string> &strs) {
vector<string> result;
if (strs.size() < 2) {
return result;
}
unordered_map<string, vector<string> > sorted_str_map;
for (vector<string>::iterator iter = strs.begin();
iter != strs.end(); ++iter) {
string ori_str = *iter;
sort(ori_str.begin(), ori_str.end());
unordered_map<string, vector<string> >::iterator map_iter = sorted_str_map.find(ori_str);
if (sorted_str_map.end() == map_iter) {
sorted_str_map.insert(std::pair<string, vector<string> >(ori_str, vector<string>(1, *iter)));
} else {
map_iter->second.push_back(*iter);
}
}
for (unordered_map<string, vector<string> >::iterator iter = sorted_str_map.begin();
iter != sorted_str_map.end(); ++iter) {
if (iter->second.size() > 1) {
result.insert(result.end(), iter->second.begin(), iter->second.end());
}
}
return result;
}
private:
};