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:
  int maxDepth(Node* root) {
    if (!root) {
      return 0;
    }
    int res = 1;
    for (auto& x : root->children) {
      res = max(res, maxDepth(x) + 1);
    }
    return res;
  }
};