class Solution {
public:
int count = 0;
int pathSum(TreeNode* root, int sum) {
if(root == nullptr)
return count;
dfs(root,sum);
pathSum(root->left,sum);
pathSum(root->right,sum);
return count;
}
void dfs(TreeNode* root,int sum){
if(root == nullptr)
return;
sum -= root->val;
if(sum == 0)
count++;
dfs(root->left,sum);
dfs(root->right,sum);
}
};
路径总和III
最新推荐文章于 2022-09-05 21:00:16 发布