https://leetcode.com/problems/path-sum-iii/
使用递归的方法
1、遍历根节点开始的路径
2、遍历根节点左子节点的路径数量
3、遍历根节点右子节点的路径数量
4、递归
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int totalPaths = 0;
public int pathSum(TreeNode root, int sum) {
if(root!=null){
traverseAllPaths(root, sum, 0);
pathSum(root.left, sum);
pathSum(root.right, sum);
}
return totalPaths;
}
private void traverseAllPaths(TreeNode root, int sum, int currentSum){
if(root !=null){
currentSum += root.val;
if(sum == currentSum){
totalPaths++;
}
traverseAllPaths(root.left, sum, currentSum);
traverseAllPaths(root.right, sum, currentSum);
}
}
}