algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1289 from cy948/patch-2

Browse Source 
Update 0112.路径总和.md
This commit is contained in:
程序员Carl
2022-05-25 09:47:09 +08:00
committed by GitHub
parent cacbbeaec7 cb6f015186
commit f7ca72c8ac
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
problems/0112.路径总和.md
View File

@ -377,22 +377,22 @@ class solution {
```java ```java
class solution { class solution {
public list<list<integer>> pathsum(treenode root, int targetsum) { public List<List<Integer>> pathsum(TreeNode root, int targetsum) {
list<list<integer>> res = new arraylist<>(); List<List<Integer>> res = new ArrayList<>();
if (root == null) return res; // 非空判断 if (root == null) return res; // 非空判断
list<integer> path = new linkedlist<>(); List<Integer> path = new LinkedList<>();
preorderdfs(root, targetsum, res, path); preorderdfs(root, targetsum, res, path);
return res; return res;
} }
public void preorderdfs(treenode root, int targetsum, list<list<integer>> res, list<integer> path) { public void preorderdfs(TreeNode root, int targetsum, List<List<Integer>> res, List<Integer> path) {
path.add(root.val); path.add(root.val);
// 遇到了叶子节点 // 遇到了叶子节点
if (root.left == null && root.right == null) { if (root.left == null && root.right == null) {
// 找到了和为 targetsum 的路径 // 找到了和为 targetsum 的路径
if (targetsum - root.val == 0) { if (targetsum - root.val == 0) {
res.add(new arraylist<>(path)); res.add(new ArrayList<>(path));
} }
return; // 如果和不为 targetsum，返回 return; // 如果和不为 targetsum，返回
} }