My c++ clean code


  • 1
    L
        class Solution {
        public:
            bool hasPathSum(TreeNode *root, int sum) {
                if(root == NULL)
                    return false;
                if(root->left == NULL && root->right == NULL)
                    return sum == root->val;
                return hasPathSum(root->left, sum - root->val) || 
                    hasPathSum(root->right, sum - root->val);
            }
        };

Log in to reply
 

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