From 95fa60c32cca538aa20115320a093bdee0500409 Mon Sep 17 00:00:00 2001
From: Baturu <45113401+z80160280@users.noreply.github.com>
Date: Tue, 8 Jun 2021 17:53:45 -0700
Subject: [PATCH] =?UTF-8?q?Update=200115.=E4=B8=8D=E5=90=8C=E7=9A=84?=
 =?UTF-8?q?=E5=AD=90=E5=BA=8F=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0115.不同的子序列.md | 17 ++++++++++++++++-
 1 file changed, 16 insertions(+), 1 deletion(-)

diff --git a/problems/0115.不同的子序列.md b/problems/0115.不同的子序列.md
index 1661acf8..e54389aa 100644
--- a/problems/0115.不同的子序列.md
+++ b/problems/0115.不同的子序列.md
@@ -148,7 +148,22 @@ Java：
 
 
 Python：
-
+```python
+class Solution:
+    def numDistinct(self, s: str, t: str) -> int:
+        dp = [[0] * (len(t)+1) for _ in range(len(s)+1)]
+        for i in range(len(s)):
+            dp[i][0] = 1
+        for j in range(1, len(t)):
+            dp[0][j] = 0
+        for i in range(1, len(s)+1):
+            for j in range(1, len(t)+1):
+                if s[i-1] == t[j-1]:
+                    dp[i][j] = dp[i-1][j-1] + dp[i-1][j]
+                else:
+                    dp[i][j] = dp[i-1][j]
+        return dp[-1][-1]
+```
 
 Go：