题目
Given an array of strings, group anagrams together.
For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],
Return:
[
["ate", "eat","tea"],
["nat","tan"],
["bat"]
]
Note: All inputs will be in lower-case.
解析
题意:输入一组字符串,按照字母组成分组
分析:利用map即可,具体看代码
代码
时间复杂度:O(nlogn) 主要是sort()引起的,sort是优化过的稳定的快排
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
unordered_map<string,vector<string>> m;
for(auto s :strs){
string t=s;
sort(t.begin(),t.end());
m[t].push_back(s);
}
vector<vector<string>> ret;
for(auto i:m){
vector<string> tmp(i.second.begin(),i.second.end());
ret.push_back(tmp);
}
return ret;
}
};
因为题中有全部为小写字母,即知道最多有26个字母,可以自己写一个O(n)时间复杂度的排序
时间复杂度体现在:随着问题规模的增大,时间增长,当规模已经确定(26)时,即使双重循环在本题中也只是O(n)
时间复杂度:O(n)
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
unordered_map<string,vector<string>> m;
for(auto s :strs){
string t=strSort(s);
m[t].push_back(s);
}
vector<vector<string>> ret;
for(auto i:m){
vector<string> tmp(i.second.begin(),i.second.end());
ret.push_back(tmp);
}
return ret;
}
private:
string strSort(string s) {
int count[26] = {0}, n = s.length();
for (int i = 0; i < n; i++)
count[s[i] - 'a']++;
int p = 0;
string t(n, 'a');
for (int j = 0; j < 26; j++)
for (int i = 0; i < count[j]; i++)
t[p++] += j;
return t;
}
};