标签：
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
[Solution]
table[k] = table[j - 1] * table[k - j]
1 int numTrees(int n) 2 { 3 if (n <= 0) 4 return 0; 5 vector<int> table(n + 1, 0); 6 7 table[0] = 1; 8 table[1] = 1; 9 for (int i = 2; i <= n; i++) 10 { 11 for (int j = 1; j <= i; j++) 12 { 13 table[i] += table[j - 1] * table[i - j]; 14 } 15 } 16 17 return table[n]; 18 }
leetcode 96. Unique Binary Search Trees
标签：
原文地址：http://www.cnblogs.com/ym65536/p/4296139.html
