leetcode-96-Unique Binary Search Trees
来源:互联网 发布:李升平知乎 编辑:程序博客网 时间:2024/05/20 23:58
问题
题目:[leetcode-96]
思路
catalan数。至于怎么分析的,参考自己的lintcode刷题里对这个题的解释。基本方法是固定根节点之后,剩下的N-1个节点,依次在左右两支展开。
代码
class Solution {public: int numTrees(int n) { return catalan(n); }private: int catalan(int n) { vector<int> dp(n+1, 0); dp[0] = dp[1] = 1; for(int i = 2; i <= n; ++i) { for(int j = 0; j < i; ++j) { dp[i] += dp[j]*dp[i-1-j]; } } return dp[n]; }};
阅读全文
0 0
- LeetCode 96 Unique Binary Search Trees II
- [leetcode 96] Unique Binary Search Trees
- Leetcode NO.96 Unique Binary Search Trees
- leetcode || 96、Unique Binary Search Trees
- [Leetcode 96, Medium] Unique Binary Search Trees
- leetcode-96 Unique Binary Search Trees
- Unique Binary Search Trees - LeetCode 96
- Leetcode 96 Unique Binary Search Trees
- Leetcode[96]-Unique Binary Search Trees
- Leetcode 96 Unique Binary Search Trees
- leetcode[96]:Unique Binary Search Trees
- [leetcode 96]Unique Binary Search Trees
- Leetcode # 96 Unique Binary Search Trees
- LeetCode(96) Unique Binary Search Trees
- [leetcode-96]Unique Binary Search Trees(c++)
- leetcode 96: Unique Binary Search Trees
- leetCode #96 Unique Binary Search Trees
- leetcode 95-96:Unique Binary Search Trees
- HTTP请求字符串解析
- 将字符串中的空格替换为%20
- 私有云中Kubernetes Cluster HA方案
- 微信公众账号开发简单实例【java】
- 机器学习竞赛技巧
- leetcode-96-Unique Binary Search Trees
- brew install node 安装提示Ruby版本错误等问题
- #!/usr/bin/python和#!/usr/bin/env的区别
- Java并发编程:线程池的使用
- c++ 创建有序单链表,以及两个有序单链表合并
- 一只爬虫带你看世界【5】#批量下载图片
- 20171025-迷恋小概率事件
- 修饰词的应用
- Codeforces Round #312 (Div. 2)——C暴力技巧——Amr and Chemistry