[ 二叉树 ] 路径总和

路径总和

递归

• DFS

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        // 递归边界，叶子和NULL
        if (!root) return false;
        if (!root->left && !root->right && targetSum == root->val) return true;
        
        // 没有到达边界继续往子树递归
        return hasPathSum(root->left, targetSum - root->val) ||
            hasPathSum(root->right, targetSum - root->val);
    }
};

非递归

• 非递归前序遍历
• 仅修改处理部分内容即可

class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        stack<TreeNode*> stk;
        // 记录路径和
        stack<int> pathSum;
        if (!root) return false;
        stk.push(root);
        pathSum.push(root->val);
        while(!stk.empty()) {
            TreeNode* node = stk.top();
            stk.pop();
            if (node) {
                if (node->right) stk.push(node->right);
                if (node->left) stk.push(node->left);
                stk.push(node);
                stk.push(nullptr);
            }
            // 修改处理部分即可
            else {
                node = stk.top();
                stk.pop();
                // 处理部分
                int now = pathSum.top();
                pathSum.pop();
                if (!node->left && !node->right)
                    if (now == targetSum) return true;
                if (node->right) pathSum.push(now + node->right->val);
                if (node->left) pathSum.push(now + node->left->val);
            }
        }
        return false;
    }
};