mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
Update 0096.不同的二叉搜索树.md
Added python version code
This commit is contained in:
@ -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
|
||||||
|
Reference in New Issue
Block a user