112. Path Sum

112. Path Sum

My Submissions

Question

Total Accepted: 94794  Total Submissions: 305442  Difficulty: Easy

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and  sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

看到这种题目，首先想到就是DFS。

 
class Solution {
public:
    bool ok=false;
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root)return false;
        dfs(root,sum,0);
        return ok;
    }
    void dfs(TreeNode *root,int sum,int t)
    {
        if(ok)return;
        if(root->left==NULL&&root->right==NULL&&t+root->val==sum){
            ok=true;
        }
        if(root->left)dfs(root->left,sum,t+root->val);
        if(root->right)dfs(root->right,sum,t+root->val);
    }
};

然后去网上看了看大神的代码，跪。。。虽然思路很简单，但真的自己就很难想到这种解法。

以后还是要多刷题啊！只有多练，才能开阔思路。

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