二叉树中和为某一值的路径

牛客BM29 二叉树中和为某一值的路径(一)

bool hasPathSum(TreeNode* root, int sum)
{
    if(!root) return false;
    if(!root->left && !root->right && sum==root->val) return true;
    return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
}

力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> ans;
    vector<vector<int>> pathSum(TreeNode* root, int target) {
        dfs(root,target,vector<int>(),0);
        return ans;
    }

    void dfs(TreeNode* root, int target, vector<int> sum, int nowSum)
    {
        if(!root) return;
        nowSum+=root->val;
        sum.push_back(root->val);
        if(!root->left&&!root->right&&nowSum==target)
        {
            ans.push_back(sum);
            return;
        }
        dfs(root->left,target,sum,nowSum);
        dfs(root->right,target,sum,nowSum);
    }
};