Path Sum I (C++)

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) {
        if(!root) return false;
        
        if(root->val == sum && !root->left && !root->right) return true;
        
        bool lf = hasPathSum(root->left, sum-root->val);
        bool rf = hasPathSum(root->right, sum-root->val);
        
        return lf||rf;
    }
};

 
微信の公衆番号に注目してください.コンピュータの視覚: