[LeetCode] Unique Binary Search Trees, leetcodebinary
Question:
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.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
Ideas:
When n = 0, there is only one empty tree. When n = 1, there is only one possibility, that is, 1.
N> = 2, for 12... n, respectively, with I as the root node, then the left side of the I-1 nodes, the right side of the n-i-1 nodes, so
F [n] + = f [k-1] * f [n-k-1], k =,..., n-1
Code:
C ++:
class Solution {public: int numTrees(int n) { int *cnt = new int[n+1]; memset(cnt,0,(n+1)*sizeof(int)); cnt[0] = 1; cnt[1] = 1; for(int i = 2;i <= n;i++) for(int j = 0;j < i;++j) cnt[i] += cnt[j]*cnt[i-j-1]; int sum = cnt[n]; delete []cnt; return sum; }};
Python:
class Solution: # @return an integer def numTrees(self, n): f = [0 for x in range(0,n+1)] f[0] = 1 f[1] = 1 for i in range(2,n+1): for j in range(0,i): f[i] += f[j]*f[i-j-1] return f[n]