leetcode_120 Path Sum

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.

Note: A leaf is a node with no children.

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，当为叶子节点时（左子树为空，右子树为空），看走过的路径和是否为sum

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool PathSum(TreeNode* root,int sum)
    {
        if(root->left==NULL && root->right == NULL)
        {
            if(root->val == sum)
                return true;
        }
        if(root->left)
            if(PathSum(root->left,sum - root->val))
                return true;
        if(root->right)
            if(PathSum(root->right,sum - root->val))
                return true;
        return false;
    }
    bool hasPathSum(TreeNode* root, int sum) {
        if(root == NULL)
            return false;
        if(PathSum(root,sum))
            return true;
        return false;
    }
};