码迷,mamicode.com
首页 > 其他好文 > 详细

【easy-】437. Path Sum III 二叉树任意起始区间和

时间:2018-02-17 20:30:41      阅读:209      评论:0      收藏:0      [点我收藏+]

标签:lin   div   sum   not   pos   color   ==   roo   root   

/**
 * 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:
    int pathSum(TreeNode* root, int sum) {
        if (root == NULL)
            return 0;
        return Sum(root, 0, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
    }
private:
    //pre为前面节点的和,cur为前面加上现在遍历到的节点;
    int Sum(TreeNode* root, int pre, int sum){
        if (root == NULL)
            return 0;
        int cur = pre + root->val;

        return (cur == sum) + Sum(root->left, cur, sum) + Sum(root->right, cur, sum);
    }
};
root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /      5   -3
   / \      3   2   11
 / \   3  -2   1

Return 3. The paths that sum to 8 are:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

【easy-】437. Path Sum III 二叉树任意起始区间和

标签:lin   div   sum   not   pos   color   ==   roo   root   

原文地址:https://www.cnblogs.com/sherry-yang/p/8452132.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!