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

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.

Show Tags

Have you met this question in a real interview?

这个题关键在于如何在递归中计算遍历的节点的和，一个技巧就是入口处加，出口处减，当然还有的诀窍是传值传递参数

首先看用全局变量或者引用传递的方法，用时20ms

1. int num=0;
   
2. bool hasPathSum(TreeNode *root, int sum){
   
3.     if(root==NULL)
   
4.         return false;
   
5.     num+=root->val;
   
6.     if(root->left==NULL && root->right==NULL){
   
7.         if(num==sum){
   
8.             num-=root->val;
   
9.             return true;
   
10.         }
    
11.         else{
    
12.             num-=root->val;
    
13.             return false;
    
14.         }
    
15.     }
    
16.     bool result= hasPathSum(root->left,sum)||hasPathSum(root->right,sum);
    
17.     num-=root->val;
    
18.     return result;
    
19. }

然后看值传递的方式：耗时80ms，明显慢一些，和传了三个参数关系不大，因为去掉成两个参数之后还是76ms

1. bool f(TreeNode *root, int& sum, int num){
   
2.     if(root==NULL)
   
3.         return false;
   
4.     num+=root->val;
   
5.     if(root->left==NULL && root->right==NULL){
   
6.         if(num==sum){
   
7.             return true;
   
8.         }
   
9.         else{
   
10.             return false;
    
11.         }
    
12.     }
    
13.     return f(root->left,sum,num)||f(root->right,sum,num);
    
14. }
    
15. bool hasPathSum(TreeNode *root, int sum){
    
16.     return f(root,sum,0);
    
17. }

引申一下，如果要求树的所有路径和呢？

void help(TreeNode *root, int& num){
    if(root==NULL){
    }
    else if(root->left==NULL && root->right==NULL){
        num+=root->val;
        cout<<num<<endl;
        num-=root->val;
    }
    else{
        num+=root->val;
        help(root->left,num);
        help(root->right,num);
        num-=root->val;
    }
}

如果是值传递呢？return的时候值传递的参数会被销毁，所以可以不用减去上次加的值。

void help(TreeNode *root, int num){
    if(root==NULL){
    }
    else if(root->left==NULL && root->right==NULL){
        num+=root->val;
        cout<<num<<endl;
    }
    else{
        num+=root->val;
        help(root->left,num);
        help(root->right,num);
    }
}

若把NULL也当做叶子节点呢？

void help(TreeNode *root, int num){
    if(root==NULL){
        cout<<num<<endl;
    }
    else{
        num+=root->val;
        help(root->left,num);
        help(root->right,num);
    }
}