【二叉树】437. Path Sum III(理解递归)
2017-08-24 17:26
411 查看
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:
要注意,题目说了路径可以不从根开始
解答:
/**
* 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) return 0;
int cur=0;
return dfs(root,sum,0)+pathSum(root->left,sum)+pathSum(root->right,sum);
}
int dfs(TreeNode* root,int sum,int pre){
if(!root) return 0;
int cur=pre+root->val;
return (cur==sum)+dfs(root->left,sum,cur)+dfs(root->right,sum,cur);
}
};这个题的递归还是很有意思的,递归的题目就是。。写出来觉得很简单,写的时候却总出错。。。
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: 1. 5 -> 3 2. 5 -> 2 -> 1 3. -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 {
public:
int pathSum(TreeNode* root, int sum) {
if(!root) return 0;
int cur=0;
return dfs(root,sum,0)+pathSum(root->left,sum)+pathSum(root->right,sum);
}
int dfs(TreeNode* root,int sum,int pre){
if(!root) return 0;
int cur=pre+root->val;
return (cur==sum)+dfs(root->left,sum,cur)+dfs(root->right,sum,cur);
}
};这个题的递归还是很有意思的,递归的题目就是。。写出来觉得很简单,写的时候却总出错。。。
相关文章推荐
- LeetCode 437. Path Sum III 递归中使用递归,分两类情况
- leetcode_437. Path Sum III-二叉树
- [LeetCode]437. Path Sum III(求二叉树中路径和等于sum的数量)
- LeetCode 437. Path Sum III 题解 和固定的二叉树路径数目
- 437. Path Sum III(二叉树的路径和之三)
- 5.4.4—二叉树的递归—Path Sum II
- [LeetCode]437. Path Sum III
- [LeetCode] 437. Path Sum III 路径和 III
- 437. Path Sum III
- leetcode 437. Path Sum III 深度优先遍历DFS+两个递归函数
- [LeetCode]437. Path Sum III
- LeetCode-437. Path Sum III
- 437. Path Sum III
- Leetcode 437. Path Sum III
- Leetcode 437. Path Sum III (Easy) (cpp)
- 437. Path Sum III
- LeetCode - 437. Path sum III
- [leetcode]437. Path Sum III
- 【二叉树的递归】04找出二叉树中路径和等于给定值的所有路径【Path Sum II】
- LeetCode 437. Path Sum III (STL map前缀和)