mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Merge pull request #368 from z80160280/z80160280-patch-13
Update 0115.不同的子序列.md
This commit is contained in:
@ -148,7 +148,22 @@ Java:
|
|||||||
|
|
||||||
|
|
||||||
Python:
|
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:
|
Go:
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user