From d0f6653a6f371ee22130116470030bd35b925212 Mon Sep 17 00:00:00 2001
From: MAX <61301100+miaoxu404@users.noreply.github.com>
Date: Fri, 27 Sep 2024 11:51:01 +0800
Subject: [PATCH] =?UTF-8?q?Update=200112.=E8=B7=AF=E5=BE=84=E6=80=BB?=
 =?UTF-8?q?=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

it's important to avoid using reserved keywords as variable names. so i suggest changing "sum" to "targetSum"
In order to maintain consistency with the original LeetCode problem, the term "TreeNode" can be replaced with "Optional[TreeNode]".
---
 problems/0112.路径总和.md | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index 6709a2fb..e6ccc6ae 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -564,10 +564,10 @@ class Solution:
             
         return False
     
-    def hasPathSum(self, root: TreeNode, sum: int) -> bool:
+    def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:
         if root is None:
             return False
-        return self.traversal(root, sum - root.val)      
+        return self.traversal(root, targetSum - root.val)      
 ```
 
 (版本二) 递归 + 精简
@@ -579,12 +579,12 @@ class Solution:
 #         self.left = left
 #         self.right = right
 class Solution:
-    def hasPathSum(self, root: TreeNode, sum: int) -> bool:
+    def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:
         if not root:
             return False
-        if not root.left and not root.right and sum == root.val:
+        if not root.left and not root.right and targetSum == root.val:
             return True
-        return self.hasPathSum(root.left, sum - root.val) or self.hasPathSum(root.right, sum - root.val)
+        return self.hasPathSum(root.left, targetSum - root.val) or self.hasPathSum(root.right, targetSum - root.val)
   
 ```
 (版本三) 迭代
@@ -596,7 +596,7 @@ class Solution:
 #         self.left = left
 #         self.right = right
 class Solution:
-    def hasPathSum(self, root: TreeNode, sum: int) -> bool:
+    def hasPathSum(self, root: Optional[TreeNode], targetSum: int) -> bool:
         if not root:
             return False
         # 此时栈里要放的是pair<节点指针，路径数值>
@@ -659,13 +659,13 @@ class Solution:
 
         return
 
-    def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]:
+    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
         self.result.clear()
         self.path.clear()
         if not root:
             return self.result
         self.path.append(root.val) # 把根节点放进路径
-        self.traversal(root, sum - root.val)
+        self.traversal(root, targetSum - root.val)
         return self.result 
 ```
 
@@ -678,7 +678,7 @@ class Solution:
 #         self.left = left
 #         self.right = right
 class Solution:
-    def pathSum(self, root: TreeNode, targetSum: int) -> List[List[int]]:
+    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
         
         result = []
         self.traversal(root, targetSum, [], result)
@@ -703,7 +703,7 @@ class Solution:
 #         self.left = left
 #         self.right = right
 class Solution:
-    def pathSum(self, root: TreeNode, targetSum: int) -> List[List[int]]:
+    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
         if not root:
             return []
         stack = [(root, [root.val])]