编程练习--二叉树和为某一值的路径

编程练习–二叉树和为某一值的路径

import java.util.ArrayList;
/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/

public class Solution {
    private ArrayList<ArrayList<Integer>> allList = new ArrayList<ArrayList<Integer>>();
    private ArrayList<Integer> list = new ArrayList<Integer>();
    public ArrayList<ArrayList<Integer>> FindPath(TreeNode root,int target) {
        if(root==null)
            return allList;
        int c = target - root.val;
        list.add(root.val);
        if(c==0 && root.left==null && root.right==null){
            allList.add(new ArrayList<Integer>(list));
            list.remove(list.size()-1);
            return allList;
        }
        FindPath(root.left,c);
        FindPath(root.right,c);
        list.remove(list.size()-1);
        
        return allList;
    }
}

总结：运用了递归的思想，注意在节点插入之后还要将其移除