leetcode 437.Path Sum III (路径和III）

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

给出一棵二叉树，找出得到给定值的路径数
路径可以从任意节点开始，但是必须是向下走的

思路：
两个函数，一个遍历所有节点，一个遍历以当前节点为root的子树

遍历以当前节点为root的函数：
root值如果等于target值，那么直接path++
中序遍历，遍历左右子树的时候，和变为sum-root.val

遍历所有节点：
中序遍历所有节点

class Solution {
    int count = 0;
    public int pathSum(TreeNode root, int sum) {
        if (root == null) {
            return 0;
        }
        
        getSum(root, sum);
        pathSum(root.left, sum);
        pathSum(root.right, sum);
        
        return count;
    }
    
    public void getSum(TreeNode root, int sum) {
        if (root == null) {
            return;
        }
        
        if (root.val == sum) {
            count ++;
        }
        
        getSum(root.left, sum - root.val);
        getSum(root.right, sum - root.val);
    }
}