1.例题
链接:https://leetcode.cn/problems/unique-binary-search-trees/description/
1.dp[i]:以i为根节点的二叉搜索树个数
2.dp[i]+=dp[j-1]*dp[i-j]
3二叉搜索树的个数=左节点个数×右节点个数
链接:https://leetcode.cn/problems/unique-binary-search-trees/description/
1.dp[i]:以i为根节点的二叉搜索树个数
2.dp[i]+=dp[j-1]*dp[i-j]
3二叉搜索树的个数=左节点个数×右节点个数