leetcode 日经贴，Cpp code -Path Sum

Path Sum

/** * 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->left && !root->right) {            return root->val == sum;        }        sum -= root->val;        return hasPathSum(root->left, sum) || hasPathSum(root->right, sum);    }};