class Solution {
public:
int pathSum(TreeNode* root, int sum)
{
if(root == NULL)
return 0;
return DFS(root, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
}
int DFS(TreeNode* root, int sum)
{
int ret = 0;
if(root == NULL)
return ret;
if(sum == root->val)
ret ++;
ret += DFS(root->left, sum - root->val);
ret += DFS(root->right, sum - root->val);
return ret;
}
};
LeetCode#437. 路径总和 III
最新推荐文章于 2023-01-12 15:36:02 发布