Merge branch 'master' of https://github.com/jasoncao11/Algorithm-notebook

Author: jasoncao11

99. 把二叉搜索树转换为累加树.md

@@ -10,14 +10,15 @@
 class Solution:
     def convertBST(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
         self.total = 0
-        def recur(node):
+        def dfs(node):
+            #1.更新total 2.变成累加
             if not node:
                 return
-            recur(node.right)
+            dfs(node.right)
             self.total += node.val
             node.val = self.total
-            recur(node.left)
+            dfs(node.left)
 
         recur(root)
         return root
-```
+```

P100. 打家劫舍 III.md

@@ -10,6 +10,7 @@
 class Solution:
     def rob(self, root: Optional[TreeNode]) -> int:
         def dfs(node):
+            #返回该节点不偷和偷状态下能够偷取的最大值
             if node is None:
                 return [0,0]
             
@@ -25,4 +26,4 @@ class Solution:
 
         res = dfs(root)
         return max(res)
-```
+```