aboutsummaryrefslogtreecommitdiff
path: root/works/solutions/leetcode/cpp/96.cpp
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2021-02-23 21:07:19 +0800
committercrupest <crupest@outlook.com>2021-02-23 21:07:19 +0800
commit185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 (patch)
tree3f19388b054fb2a12230706681dd62f077890c51 /works/solutions/leetcode/cpp/96.cpp
parentca5a0f8dde5d8d9d7f877a790d05a270cc3224f9 (diff)
downloadcrupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.gz
crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.tar.bz2
crupest-185ef9fcb0e59f13e9ee0ccb261693cdaddebab0.zip
import(solutions): Move leetcode solutions to subdir.
Diffstat (limited to 'works/solutions/leetcode/cpp/96.cpp')
-rw-r--r--works/solutions/leetcode/cpp/96.cpp14
1 files changed, 14 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/96.cpp b/works/solutions/leetcode/cpp/96.cpp
new file mode 100644
index 0000000..3757baa
--- /dev/null
+++ b/works/solutions/leetcode/cpp/96.cpp
@@ -0,0 +1,14 @@
+class Solution {
+public:
+ // catalan number:
+ // f(n) = f(0) * f(n-1) + f(1) * f(n-2) + ... + f(n-1)*f(0)
+ // f(n) = 2(2n-1) * f(n-1) / (n+1)
+ // f(n) = C(2n, n) / (n+1)
+ int numTrees(int n) {
+ long long result = 1;
+ for (int i = 2; i <= n; i++) {
+ result = 2 * (2 * i - 1) * result / (i + 1);
+ }
+ return result;
+ }
+};