【leetcode】Unique Binary Search Trees
来源:互联网 发布:作家 知乎 编辑:程序博客网 时间:2024/05/21 03:29
Unique Binary Search Trees
Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?
For example,
Given n = 3, there are a total of 5 unique BST’s.
这道题目提交将近10遍。。。动态规划的算法明确了,明确独特树的个数主要取决于左子树和右子树的个数的乘积就可以了
特别要注意数列的初始化!!!
C数组的初始化,我这里使用for循环做的,也可以用memset(f, 0, sizeof(f));
int numTrees(int n) { if(n<=0) return 0; int f[n+1]; f[0]=1; f[1]=1; for(int i=2;i<=n;i++) { f[i]=0; for(int j=0; j<i;j++) { f[i]=f[i]+f[j]*f[i-j-1]; } } return f[n];}
0 0
- LeetCode: Unique Binary Search Trees
- LeetCode : Unique Binary Search Trees
- [Leetcode] Unique Binary Search Trees
- [LeetCode]Unique Binary Search Trees
- LeetCode Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- LeetCode-Unique Binary Search Trees
- [leetcode] Unique Binary Search Trees
- LeetCode - Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- 【Leetcode】Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- 【LeetCode】Unique Binary Search Trees
- Leetcode Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- [LeetCode] Unique Binary Search Trees
- Leetcode: Unique Binary Search Trees
- LeetCode | Unique Binary Search Trees
- #!/bin/sh與#!/bin/bash的區別
- 2.30
- 解决无法安装这个包PCLZIP_ERR_BAD_FORMAT (-10) : Unable to find End of Central Dir Record signature
- 作业3.22
- CodeForces 10A Power Consumption Calculation
- 【leetcode】Unique Binary Search Trees
- [python]插入排序和希尔排序
- 更新Android SDK之后Eclipse提示ADT版本过低的一个简易解决办法
- 3.23
- Qt学习(一)
- win7下配置IIS以及错误模块“ManagedPipelineHandler”解决方法
- udp发包大小选择
- android ntp更改网络时间服务器
- 3.24