1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
|
class Solution { public: bool hasPathSum(TreeNode* root, int targetSum) { return helper(root, 0, targetSum); } private: bool helper(TreeNode* node, int cur, int targetSum) { if(!node) return false; cur += node->val; if(!node->left && !node->right && cur == targetSum) return true; return helper(node->left, cur, targetSum) || helper(node->right, cur, targetSum); } };
|