2019-11-02 12:07:41 +08:00
|
|
|
|
# 34. 二叉树中和为某一值的路径
|
|
|
|
|
|
|
|
|
|
|
|
[NowCoder](https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github)
|
|
|
|
|
|
|
|
|
|
|
|
## 题目描述
|
|
|
|
|
|
|
|
|
|
|
|
输入一颗二叉树和一个整数，打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。
|
|
|
|
|
|
|
|
|
|
|
|
下图的二叉树有两条和为 22 的路径：10, 5, 7 和 10, 12
|
|
|
|
|
|
|
2019-12-05 01:47:57 +08:00
|
|
|
|
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/ed77b0e6-38d9-4a34-844f-724f3ffa2c12.jpg" width="200"/> </div><br>
|
2019-11-02 12:07:41 +08:00
|
|
|
|
|
|
|
|
|
|
## 解题思路
|
|
|
|
|
|
|
|
|
|
|
|
```java
|
|
|
|
|
|
private ArrayList<ArrayList<Integer>> ret = new ArrayList<>();
|
|
|
|
|
|
|
|
|
|
|
|
public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int target) {
|
|
|
|
|
|
backtracking(root, target, new ArrayList<>());
|
|
|
|
|
|
return ret;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
private void backtracking(TreeNode node, int target, ArrayList<Integer> path) {
|
|
|
|
|
|
if (node == null)
|
|
|
|
|
|
return;
|
|
|
|
|
|
path.add(node.val);
|
|
|
|
|
|
target -= node.val;
|
|
|
|
|
|
if (target == 0 && node.left == null && node.right == null) {
|
|
|
|
|
|
ret.add(new ArrayList<>(path));
|
|
|
|
|
|
} else {
|
|
|
|
|
|
backtracking(node.left, target, path);
|
|
|
|
|
|
backtracking(node.right, target, path);
|
|
|
|
|
|
}
|
|
|
|
|
|
path.remove(path.size() - 1);
|
|
|
|
|
|
}
|
|
|
|
|
|
```
|
2019-11-02 14:39:13 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-11-02 17:33:10 +08:00
|
|
|
|
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>
|
