LEETCODE--Path Sum III
2017-02-15 13:00
302 查看
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.
Example:
root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8
Return 3. The paths that sum to 8 are:
5 -> 3
5 -> 2 -> 1
-3 -> 11
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.
Example:
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:
5 -> 3
5 -> 2 -> 1
-3 -> 11
/** * 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 { private: int Thispoint(TreeNode* root , int valsum ,int sum){ if( !root) return 0; valsum += root->val; return (valsum == sum) + Thispoint(root->right, valsum, sum) + Thispoint(root->left, valsum, sum); } public: int pathSum(TreeNode* root, int sum) { if( !root) return 0; return Thispoint (root, 0, sum) + pathSum(root->left, sum) + pathSum(root->right, sum); } };
相关文章推荐
- LeetCode--437. Path Sum III(路径和)Python
- LeetCode 437 Path Sum III 题解
- LeetCode -- Path Sum III分析及实现方法
- leetcode_437. Path Sum III-二叉树
- LeetCode Path Sum III
- [leetcode] 437. Path Sum III 解题报告
- LeetCode 437. Path Sum III 题解 和固定的二叉树路径数目
- leetcode-437-Path Sum III
- Leetcode oj java Path Sum III
- [LeetCode]437. Path Sum III
- LeetCode No.437 Path Sum III
- LeetCode笔记:437. Path Sum III
- LeetCode 437. Path Sum III
- Leetcode--Path Sum I,II,III
- LeetCode : Path Sum III
- LeetCode 437 Path Sum III
- [Leetcode] Path Sum I,II,III
- leetcode 437. Path Sum III
- LeetCode 437. Path Sum III 递归中使用递归,分两类情况
- [LeetCode]437. Path Sum III