437. Path Sum III

最新推荐文章于 2021-01-14 21:48:33 发布

myfwjy

最新推荐文章于 2021-01-14 21:48:33 发布

阅读量226

点赞数

分类专栏： LeetCode 文章标签： LeetCode DFS

本文链接：https://blog.csdn.net/myfwjy/article/details/53839568

版权

LeetCode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

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

      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 0;
		}
		if (root.val == sum) {
			res++;
		}
		if (root.left != null) {
			res += dfs(root.left, sum - root.val);
		}
		if (root.right != null) {
			res += dfs(root.right, sum - root.val);
		}
		return res;
	}
}