题解 | #牛的奶量统计#
牛的奶量统计
https://www.nowcoder.com/practice/213c039668804add9513bbee31370248
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * }; */ class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @param targetSum int整型 * @return bool布尔型 */ bool hasPathSum(TreeNode* root, int curSum, int targetSum) { if (curSum == targetSum) return true; bool flag = false; if (root->left) { flag = hasPathSum(root->left, curSum+root->left->val, targetSum); } if (flag) return true; if (root->right) { flag = hasPathSum(root->right, curSum+root->right->val, targetSum); } if (flag) return true; return false; } bool hasPathSum(TreeNode* root, int targetSum) { // write code here if (root == nullptr) return false; return hasPathSum(root, root->val, targetSum); } };