Accepted solution with cpp in 52ms


  • 1
    J
    /**
     * 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 (NULL == root)
                return false;
            return h(root, sum);
        }
        bool h(TreeNode *root, int sum){
            if (!root)
                return false;
            if (NULL == root->left && NULL == root->right){
                if (0 == sum-root->val)
                    return true;
                else return false;
            }
            return h(root->left, sum-root->val) || h(root->right, sum-root->val);
        }
    };

  • 0
    U

    i've read your solution,it is amaing ,but i still have a question,

    @why did you write anther function h(); ? will it be more effective?


Log in to reply
 

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