From e191a711adc93d2cb4fcdd5a779e0cdf12107e61 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Mon, 17 May 2021 16:11:50 +0800
Subject: [PATCH 1/3] =?UTF-8?q?Update=200718.=E6=9C=80=E9=95=BF=E9=87=8D?=
=?UTF-8?q?=E5=A4=8D=E5=AD=90=E6=95=B0=E7=BB=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
problems/0718.最长重复子数组.md | 21 +++++++++++++++++++++
1 file changed, 21 insertions(+)
diff --git a/problems/0718.最长重复子数组.md b/problems/0718.最长重复子数组.md
index c20ea79f..f0f9a883 100644
--- a/problems/0718.最长重复子数组.md
+++ b/problems/0718.最长重复子数组.md
@@ -160,7 +160,28 @@ Python：
Go：
+```Go
+func findLength(A []int, B []int) int {
+ m, n := len(A), len(B)
+ res := 0
+ dp := make([][]int, m+1)
+ for i := 0; i <= m; i++ {
+ dp[i] = make([]int, n+1)
+ }
+ for i := 1; i <= m; i++ {
+ for j := 1; j <= n; j++ {
+ if A[i-1] == B[j-1] {
+ dp[i][j] = dp[i-1][j-1] + 1
+ }
+ if dp[i][j] > res {
+ res = dp[i][j]
+ }
+ }
+ }
+ return res
+}
+```
From 7869aaa1c015f845da645583731a5ff88acc6f97 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Mon, 17 May 2021 11:14:30 +0200
Subject: [PATCH 2/3] =?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
python version of code added
---
problems/0112.路径总和.md | 30 +++++++++++++++++++++++++++---
1 file changed, 27 insertions(+), 3 deletions(-)
diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index ecbefd90..e11384da 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -348,8 +348,32 @@ class Solution {
```
Python：
-
-
+```python
+// 递归法
+# Definition for a binary tree node.
+# class TreeNode:
+# def __init__(self, val=0, left=None, right=None):
+# self.val = val
+# self.left = left
+# self.right = right
+class Solution:
+ def hasPathSum(self, root: TreeNode, targetSum: int) -> bool:
+ def isornot(root,targetSum)->bool:
+ if (not root.left) and (not root.right) and targetSum == 0:return True // 遇到叶子节点，并且计数为0
+ if (not root.left) and (not root.right):return False //遇到叶子节点，计数不为0
+ if root.left:
+ targetSum -= root.left.val //只有左节点
+ if isornot(root.left,targetSum):return True //递归，处理节点
+ targetSum += root.left.val //回溯
+ if root.right:
+ targetSum -= root.right.val //只有右节点
+ if isornot(root.right,targetSum):return True //递归，处理右节点
+ targetSum += root.right.val //回溯
+ return False
+
+ if root == None:return False //别忘记处理空TreeNode
+ else:return isornot(root,targetSum-root.val)
+```
Go：
JavaScript：
@@ -427,4 +451,4 @@ let pathSum = function (root, targetSum) {
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
From 13e7e637a77273921e6b15475dd899d39e3c84dd Mon Sep 17 00:00:00 2001
From: charon2121 <66763177+charon2121@users.noreply.github.com>
Date: Mon, 17 May 2021 23:50:55 +0800
Subject: [PATCH 3/3] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20144.=E4=BA=8C=E5=8F=89?=
=?UTF-8?q?=E6=A0=91=E7=9A=84=E5=89=8D=E5=BA=8F=E9=81=8D=E5=8E=86python3?=
=?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
添加 94.二叉树的中序遍历python3版本
添加 145.二叉树的后序遍历python3版本
---
problems/二叉树的递归遍历.md | 46 ++++++++++++++++++++++++++++
1 file changed, 46 insertions(+)
diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index e8cf0bdd..937ef603 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -170,7 +170,53 @@ class Solution {
```
Python：
+```python3
+# 前序遍历-递归-LC144_二叉树的前序遍历
+class Solution:
+ def preorderTraversal(self, root: TreeNode) -> List[int]:
+ # 保存结果
+ result = []
+
+ def traversal(root: TreeNode):
+ if root == None:
+ return
+ result.append(root.val) # 前序
+ traversal(root.left) # 左
+ traversal(root.right) # 右
+ traversal(root)
+ return result
+
+# 中序遍历-递归-LC94_二叉树的中序遍历
+class Solution:
+ def inorderTraversal(self, root: TreeNode) -> List[int]:
+ result = []
+
+ def traversal(root: TreeNode):
+ if root == None:
+ return
+ traversal(root.left) # 左
+ result.append(root.val) # 中序
+ traversal(root.right) # 右
+
+ traversal(root)
+ return result
+
+# 后序遍历-递归-LC145_二叉树的后序遍历
+class Solution:
+ def postorderTraversal(self, root: TreeNode) -> List[int]:
+ result = []
+
+ def traversal(root: TreeNode):
+ if root == None:
+ return
+ traversal(root.left) # 左
+ traversal(root.right) # 右
+ result.append(root.val) # 后序
+
+ traversal(root)
+ return result
+```
Go：
