/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
if (root != null){
pathSumHelper(root, sum, result, new ArrayList<Integer>());
}
return result;
}
public void pathSumHelper(TreeNode root, int sum, List<List<Integer>> result, List<Integer> path){
if (root == null) return;
path.add(root.val);
if (root.val == sum && root.left == null && root.right == null){
result.add(path);
}else{
pathSumHelper(root.left, sum-root.val, result, new ArrayList<Integer>(path));
pathSumHelper(root.right, sum-root.val, result, new ArrayList<Integer>(path));
}
}
}
Path Sum II
最新推荐文章于 2019-04-16 20:08:36 发布