LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

• 对于字母相同的字符串的判断法是，对字符串排序，排序结果相同则字符串含有相同单词
• 对于字符串所在组，需要一个值记录其索引。每次有新的异位字符串时，递增记录值作为新的索引
• 解法如下

class Solution {
 public:
  vector<vector<string>> groupAnagrams(vector<string>& strs) {
    vector<vector<string>> res;
    unordered_map<string, int> m;
    int i = -1;
    for (auto& x : strs) {
      string t{x};
      sort(begin(t), end(t));
      if (!m.count(t)) {
        res.emplace_back(vector<string>{x});
        m.emplace(t, ++i);
      } else {
        res[m[t]].emplace_back(x);
      }
    }
    return res;
  }
};