Leetcode 49. Group Anagrams | | Leetcode 49. Group Anagrams 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution Version 1 1234567891011121314151617181920212223class Solution {public: vector<vector<string>> groupAnagrams(vector<string>& strs) { vector<vector<string>> result; unordered_map<string, vector<string>> m; for(string s : strs) { string temp = s; sort(temp.begin(), temp.end()); if(m.find(temp) != m.end()) { m[temp].push_back(s); } else { vector<string> anagrams; anagrams.push_back(s); m[temp] = anagrams; } } for(auto iter: m) { result.push_back(iter.second); } return result; }}; Version 2 12345678910111213141516class Solution {public: vector<vector<string>> groupAnagrams(vector<string>& strs) { vector<vector<string>> result; unordered_map<string, vector<string>> m; for(string s : strs) { string temp = s; sort(temp.begin(), temp.end()); m[temp].push_back(s); } for(auto iter: m) { result.push_back(iter.second); } return result; }}; Reference https://leetcode.com/problems/group-anagrams/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏