给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
该题是典型的递归题,有dfs,bfs两种方式进行。
dfs: 递归,不递归情况下要用到stack
bfs: 不递归,要用到queue
dfs做法:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
List<List<Integer>> res = new ArrayList<>();
public List<List<Integer>> pathSum(TreeNode root, int sum) {
if(root == null) return res;
List<Integer> p = new ArrayList<>();
dfs(root, 0, sum, p);
return res;
}
public void dfs(TreeNode root, int val, int sum, List<Integer> p){
if(root == null) return;
p.add(root.val);
if(val + root.val == sum && root.left == null && root.right == null){
List<Integer> tmp = new ArrayList<>();
tmp.addAll(p);
res.add(tmp);
}
dfs(root.left, val + root.val, sum, p);
dfs(root.right, val + root.val, sum, p);
p.remove(p.size()-1);
}
}
bfs方式:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
List<List<Integer>> res = new ArrayList<>();
Map<TreeNode, TreeNode> map = new HashMap<TreeNode, TreeNode>();
public List<List<Integer>> pathSum(TreeNode root, int sum) {
//基于bfs求解
if(root==null) return res;
Queue<TreeNode> queueNode = new LinkedList<>();
Queue<Integer> queueSum = new LinkedList<>();
queueNode.add(root);
queueSum.add(root.val);
while(!queueNode.isEmpty()){
TreeNode node = queueNode.poll();
int rec = queueSum.poll();
if(rec == sum && node.left == null && node.right == null){
getPath(node);
}
if(node.left != null){
queueNode.add(node.left);
queueSum.add(node.left.val + rec);
map.put(node.left, node);
}
if(node.right != null){
queueNode.add(node.right);
queueSum.add(node.right.val + rec);
map.put(node.right, node);
}
}
return res;
}
public void getPath(TreeNode node){
List<Integer> temp = new LinkedList<Integer>();
while (node != null) {
temp.add(node.val);
node = map.get(node);
}
Collections.reverse(temp);
res.add(new LinkedList<Integer>(temp));
}
}
参考: