[leetcode]437. Path Sum III
2017-01-23 16:18
513 查看
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.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int pathSum(TreeNode root, int sum) {
if(root == null) {
return 0;
}
return dfs(root, sum) +pathSum(root.left, sum) + pathSum(root.right, sum);
}
private int dfs(TreeNode root, int sum) {
int res = 0;
if(root == null) {
return res;
}
if(root.val == sum) {
res++;
}
res+=dfs(root.left, sum-root.val);
res+=dfs(root.right, sum-root.val);
return res;
}
}
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.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int pathSum(TreeNode root, int sum) {
if(root == null) {
return 0;
}
return dfs(root, sum) +pathSum(root.left, sum) + pathSum(root.right, sum);
}
private int dfs(TreeNode root, int sum) {
int res = 0;
if(root == null) {
return res;
}
if(root.val == sum) {
res++;
}
res+=dfs(root.left, sum-root.val);
res+=dfs(root.right, sum-root.val);
return res;
}
}
相关文章推荐
- LeetCode 437. Path Sum III 递归中使用递归,分两类情况
- LeetCode 437. Path Sum III (路径之和之三)
- LeetCode 437. Path Sum III 题解 和固定的二叉树路径数目
- 【LeetCode】 437. Path Sum III
- LeetCode笔记:437. Path Sum III
- LeetCode 437. Path Sum III
- LeetCode-437. Path Sum III
- [leetcode] 437. Path Sum III 解题报告
- leetcode 437. Path Sum III(路径和)(DFS)
- LeetCode 437. Path Sum III (STL map前缀和)
- LeetCode - 437. Path sum III
- [LeetCode] 437. Path Sum III 路径和 III
- leetcode_437. Path Sum III-二叉树
- [LeetCode]437. Path Sum III
- [LeetCode]437. Path Sum III(求二叉树中路径和等于sum的数量)
- leetcode 437. Path Sum III 深度优先遍历DFS+两个递归函数
- leetcode 437. Path Sum III
- 【LeetCode】112,113,437. Path Sum I, II, III
- Leetcode 437. Path Sum III
- [LeetCode]437. Path Sum III