题目描述
输入一颗二叉树和一个整数,打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。
思路:用先序遍历递归的思想去实现,到最后叶节点如果不能的话就退回去一步到叶子结点的父节点。
代码如下:
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 {
public ArrayList<ArrayList<Integer>> FindPath(TreeNode root,int target) {
ArrayList<ArrayList<Integer>> lists = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> list = new ArrayList<Integer>();
if(root == null) return lists;
int sum = 0;
return xianxu(lists,list,sum,target,root);
}
private ArrayList<ArrayList<Integer>> xianxu(
ArrayList<ArrayList<Integer>> lists,
ArrayList<Integer> list,
int sum,
int target,
TreeNode root) {
list.add(root.val);
sum = sum + root.val;
boolean pd = root.left == null && root.right == null;
if(sum == target && pd){
ArrayList<Integer> all = new ArrayList<Integer>();
for (int i:list) {
all.add(i);
}
lists.add(all);
}
if(root.left != null){
xianxu(lists,list,sum,target,root.left);
}
if(root.right != null){
xianxu(lists,list,sum,target,root.right);
}
int val = list.remove(list.size()-1);
sum = sum-1;
return lists;
}
}