lintcode,二叉树的路径和

给定一个二叉树，找出所有路径中各节点相加总和等于给定 目标值 的路径。
一个有效的路径，指的是从根节点到叶节点的路径。
样例
给定一个二叉树，和 目标值 = 5:
1
/ \
2 4
/ \
2 3
返回：
[
[1, 2, 2],
[1, 4]
]

解题思路：递归是可行的，但是需要注意每次要在结果中加入root的值。还可以用dfs来实现
一刷没ac

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @param target an integer
     * @return all valid paths
     */
    public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
        List<List<Integer>> rst = new ArrayList<List<Integer>>();
        if(root == null) return rst;
        if(root.left == null && root.right == null){
            if(target == root.val){
                List<Integer> res = new ArrayList<Integer>();
                res.add(root.val);
                rst.add(res);
            }
            return rst;
        }
        rst.addAll(binaryTreePathSum(root.left, target-root.val));
        rst.addAll(binaryTreePathSum(root.right, target-root.val));
        for(List<Integer> l : rst){
            l.add(0,root.val);
        }

        return rst;
    }

}

用栈来存储节点，遍历节点。

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @param target an integer
     * @return all valid paths
     */
    public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
        List<List<Integer>> rst = new ArrayList<List<Integer>>();
        if(root == null) return rst;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        findpath(root, target, rst, stack);
        return rst;
    }

    public void findpath(TreeNode root, int target, List<List<Integer>> rst, Stack<TreeNode> stack){
        if(root == null) return;
        if(root.left == null && root.right == null){
            if(root.val == target){
                List<Integer> res = new ArrayList<Integer>();
                for(TreeNode i : stack){
                    res.add(i.val);
                }
                res.add(target);
                rst.add(res);
            }
        }else{
            stack.push(root);
            findpath(root.left, target-root.val, rst, stack);
            findpath(root.right, target-root.val, rst, stack);
            stack.pop();
        }

    }
}

dfs实现

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @param target an integer
     * @return all valid paths
     */
    public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
        List<List<Integer>> rst = new ArrayList<List<Integer>>();
        if(root == null) return rst;
        List<Integer> res = new ArrayList<Integer>();
        dfs(root, target, rst, res);

        return rst;
    }
    public void dfs(TreeNode root, int target, List<List<Integer>> rst, List<Integer> res){
        if(root == null) return;
        res.add(new Integer(root.val));
        if(root.left == null && root.right == null && root.val == target){
            rst.add(new ArrayList(res));

        }else{
            dfs(root.left, target-root.val, rst, res);
            dfs(root.right, target-root.val, rst, res);
        }
        res.remove(res.size()-1);
    }

}