leetcode-113. Path Sum II
题目:
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.
For example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
典型的回溯法,和上一题相同,回溯法和DFS的区别就是DFS值找有没有,回溯法还找有多少,所以回溯法需要一个对象维护当前状态,需要另一个变量储存每个结果。
leetcode-112. Path Sum
/**
* Definition for a binary tree node.
* 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>> ret = new ArrayList<List<Integer>>();
helper(ret,new ArrayList<TreeNode>(), root,sum);
return ret;
}
private void helper(List<List<Integer>> ret, List<TreeNode> tmp , TreeNode node, int sum){
if(node == null) return ;
tmp.add(node);
if(node.val == sum && node.left == null & node.right == null){
List<Integer> ad = new ArrayList<Integer>();
for(TreeNode t : tmp)
ad.add(t.val);
ret.add(ad);
}
helper(ret,tmp,node.left,sum-node.val);
helper(ret,tmp,node.right,sum-node.val);
tmp.remove(tmp.size()-1);
}
}