12ms C++ solution


  • 0
    D
    class Solution {
    public:
        bool hasPathSum(TreeNode* root, int sum) {
            
            if(root==NULL)
                return false;
               
            if(root->left!=NULL || root->right!=NULL)
                return hasPathSum(root->left,sum-root->val) || hasPathSum(root->right,sum-root->val);
            else
                return sum-root->val==0 ? true:false;
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.