LeetCode Unique Binary Search Trees
2014-11-30 13:14
302 查看
链接: https://oj.leetcode.com/problems/unique-binary-search-trees/
dp[i]表示当n为i时的BST数量..递推关系如下图
这样,就把n=4分割为n=3,n=1,n=2.用dp数组记录结果
代码:
class Solution
{
public:
int numTrees(int n)
{
int dp[n+1];
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<i;j++)
{
dp[i]+=dp[j]*dp[i-j-1];
}
}
return dp
;
}
};
dp[i]表示当n为i时的BST数量..递推关系如下图
这样,就把n=4分割为n=3,n=1,n=2.用dp数组记录结果
代码:
class Solution
{
public:
int numTrees(int n)
{
int dp[n+1];
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<i;j++)
{
dp[i]+=dp[j]*dp[i-j-1];
}
}
return dp
;
}
};
相关文章推荐
- leetcode第一刷_Unique Binary Search Trees
- Leetcode108: Unique Binary Search Trees II
- 【LeetCode】Unique Binary Search Trees
- Leetcode Unique Binary Search Trees II
- LeetCode-M-Unique Binary Search Trees
- LeetCode之Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees II
- Leetcode_96_Unique Binary Search Trees
- LeetCode||95. Unique Binary Search Trees II
- leetcode Unique Binary Search Trees II java
- leetcode-Unique Binary Search Trees II
- LeetCode(96) Unique Binary Search Trees
- [LeetCode] 122: Unique Binary Search Trees II
- 【LEETCODE】95-Unique Binary Search Trees II
- leetCode 95.Unique Binary Search Trees II (唯一二叉搜索树) 解题思路和方法
- LeetCode——Unique Binary Search Trees
- 2 Unique Binary Search Trees II_Leetcode
- leetcode question 95: Unique Binary Search Trees II
- leetcode 96: Unique Binary Search Trees
- [leetcode] Unique Binary Search Trees @ Python