public List<List> pathSum(TreeNode root, int sum) {
List<List> res = new ArrayList<List>();
List list = new ArrayList();
if(root != null) {
dfs(root, sum, list, res);
}
return res;
}
private void dfs(TreeNode root, int sum, List list, List<List> res) {
使用dfs方式解决,每个路径加到list,但注意不能重复添加结点值,要删除最后一个
/**
} */ public class Solution {
public List<List> pathSum(TreeNode root, int sum) {
List<List> res = new ArrayList<List>();
List list = new ArrayList();
if(root != null) {
dfs(root, sum, list, res);
}
return res;
}
private void dfs(TreeNode root, int sum, List list, List<List> res) {
} }