二叉树根节点到叶子节点和为指定

牛客地址

解题思路

深搜+回溯

实现代码

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param root TreeNode类 
     * @param sum int整型 
     * @return int整型ArrayList<ArrayList<>>
     */
    private ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
    public ArrayList<ArrayList<Integer>> pathSum (TreeNode root, int sum) {
        // write code here
        if(root == null){
            return res;
        }
        if(root.left == null && root.right == null && root.val != sum){
            return res;
        }
        ArrayList<Integer> path = new ArrayList<Integer>();
        dfs(root, path, sum, 0);
        return res;
    }
    public void dfs(TreeNode root, ArrayList<Integer> path, int sum, int curSum){
        if(root == null){
            return;
        }
        if(root.left == null && root.right == null){
            if((curSum + root.val) == sum){
                 path.add(root.val);
                 res.add(new ArrayList<Integer>(path));
                 path.remove(path.size() - 1);
            }
        }
        path.add(root.val);
        dfs(root.left, path, sum, curSum + root.val);
        dfs(root.right, path, sum, curSum + root.val);
        path.remove(path.size() - 1);
    }
}