From be6cb9f13086cd8ea7a82a98226b02666f10cdb3 Mon Sep 17 00:00:00 2001
From: SianXiaoCHN <SilverCHN@outlook.com>
Date: Fri, 25 Mar 2022 20:35:54 -0500
Subject: [PATCH] =?UTF-8?q?0112.=E8=B7=AF=E5=BE=84=E6=80=BB=E5=92=8C=20pyt?=
 =?UTF-8?q?hon=20113=E6=B7=BB=E5=8A=A0=E8=BF=AD=E4=BB=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

0112.路径总和 python 113添加迭代法
---
 problems/0112.路径总和.md | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index ff682739..1904e92b 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -519,6 +519,30 @@ class solution:
         return result
 ```
 
+**迭代法，用第二个队列保存目前的总和与路径**
+```python
+class Solution:
+    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
+        if not root:
+            return []
+        que, temp = deque([root]), deque([(root.val, [root.val])])
+        result = []
+        while que:
+            for _ in range(len(que)):
+                node = que.popleft()
+                value, path = temp.popleft()
+                if (not node.left) and (not node.right):
+                    if value == targetSum:
+                        result.append(path)
+                if node.left:
+                    que.append(node.left)
+                    temp.append((node.left.val+value, path+[node.left.val]))
+                if node.right:
+                    que.append(node.right)
+                    temp.append((node.right.val+value, path+[node.right.val]))
+        return result
+```
+
 ## go
 
 112. 路径总和