WEI-CHENG CHEN

說明

將題目

解法

class Solution {
public:
    bool DFS(TreeNode* root, int targetSum){
        if(!root) return 0;
        // 如果是葉節點，直接檢查值是否剛好達成 targetSum
        if (!root->left && !root->right) return targetSum == root->val;
        return DFS(root->left, targetSum - root->val) || DFS(root->right, targetSum - root->val);
    }
    bool hasPathSum(TreeNode* root, int targetSum) {
        return DFS(root, targetSum);
    }
};