96. Unique Binary Search Trees
来源:互联网 发布:mysql 重启服务 编辑:程序博客网 时间:2024/06/14 05:41
递推关系,用DP求解。
例如dp[3]=dp[0]*dp[2]+dp[1]*dp[1]+dp[2]*dp[0]
class Solution {public: int numTrees(int n) { vector<int> dp(1000,0); dp[0]=1; for(int num=1;num<=n;num++) { //dp[num] for(int i=0;i<=(num-1)/2;i++) dp[num]+=dp[i]*dp[num-1-i]*2; if(num%2==1) dp[num]=dp[num]-pow(dp[(num-1)/2],2); } return dp[n]; }};
0 0
- 96.Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- 96. Unique Binary Search Trees
- list集合删除问题
- 删除字符串中指定的字符
- Java中sleep和wait有什么区别?
- 浅谈yahoo前端性能团队总结的35条黄金定律
- Lua入门第一节 序章
- 96. Unique Binary Search Trees
- 实验1:2
- Redis与Memcached的区别
- Android自定义View之PinnerHeaderListView
- pthread_create传递线程参数需要注意的问题
- android studio gradle配置
- matlab实现数据的基本读写与字符比较
- 快速排序
- lintcode77最长公共子序列(动态规划medium)