diff options
author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
---|---|---|
committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
commit | e353213dfb73259a5d33cc6e9d5cd2373c683be9 (patch) | |
tree | e879936e7e9c62f9946249cdeb470afeef1c1500 /works/solutions/leetcode/cpp/96.cpp | |
parent | 7e3e89a3f0ecc49c33334f423dbde3a5fdc57abd (diff) | |
download | crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.gz crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.bz2 crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.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.cpp | 14 |
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;
+ }
+};
|