From cae6b56b2ddda9abfc7f1116852cb11ad1e2d811 Mon Sep 17 00:00:00 2001
From: ironartisan <54694467+ironartisan@users.noreply.github.com>
Date: Mon, 6 Sep 2021 10:50:21 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00112.=E8=B7=AF=E5=BE=84?=
 =?UTF-8?q?=E6=80=BB=E5=92=8C.mdJava=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0112.路径总和.md | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index 283a9913..da62452c 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -411,6 +411,31 @@ class solution {
 }
 ```
 
+```java
+// 解法2
+class Solution {
+    List<List<Integer>> result;
+    LinkedList<Integer> path;
+    public List<List<Integer>> pathSum (TreeNode root,int targetSum) {
+        result = new LinkedList<>();
+        path = new LinkedList<>();
+        travesal(root, targetSum);
+        return result;
+    }
+    private void travesal(TreeNode root,  int count) {
+        if (root == null) return;
+        path.offer(root.val);
+        count -= root.val;
+        if (root.left == null && root.right == null && count == 0) {
+            result.add(new LinkedList<>(path));
+        }
+        travesal(root.left, count);
+        travesal(root.right, count);
+        path.removeLast(); // 回溯
+    }
+}
+```
+
 ## python
 
 0112.路径总和