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 maxPathSum(TreeNode* root) {
    int res = INT_MIN;
    dfs(root, res);
    return res;
  }

  int dfs(TreeNode* root, int& res) {
    if (!root) {
      return 0;
    }
    int l = max(dfs(root->left, res), 0);
    int r = max(dfs(root->right, res), 0);
    res = max(res, l + r + root->val);
    return root->val + max(l, r);
  }
};