112. 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.

 

结点值可能为负...

 

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    
    bool flag=false;
    
    void dfs(TreeNode* root, int sum,int tmpsum){
        if(root){
            // if(sum<tmpsum){
            //     return;
            // }   
            if(root->left==NULL&&root->right==NULL&&sum==tmpsum){
                flag=true;
                return;
            }
            if(root->left){
                dfs(root->left,sum,tmpsum+root->left->val);
            }
            if(root->right){
                dfs(root->right,sum,tmpsum+root->right->val);
            }
        }
    }
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root){
            return false;
        }
        dfs(root,sum,root->val);
        return flag;
    }
};