path-sum

2019-06-09  本文已影响0人  DaiMorph
class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) {
        if(root==NULL)return false;
        if(!root->left&&!root->right)return root->val==sum;
        return hasPathSum(root->left,sum-root->val)|
            hasPathSum(root->right,sum-root->val);
    }
};
上一篇 下一篇

猜你喜欢

热点阅读