Update 0096.不同的二叉搜索树.md

Added python version code
This commit is contained in:
LiangDazhu
2021-05-28 23:33:19 +08:00
committed by GitHub
parent f5d2d2ca66
commit 1590897824

View File

@ -186,7 +186,16 @@ class Solution {
``` ```
Python Python
```python
class Solution:
def numTrees(self, n: int) -> int:
dp = [0] * (n + 1)
dp[0], dp[1] = 1, 1
for i in range(2, n + 1):
for j in range(1, i + 1):
dp[i] += dp[j - 1] * dp[i - j]
return dp[-1]
```
Go Go
```Go ```Go