diff options
author | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
---|---|---|
committer | Yuqian Yang <crupest@crupest.life> | 2025-02-28 23:13:39 +0800 |
commit | 99e2e923d0c77b02f3fb4ff648ea916954868606 (patch) | |
tree | ec8e03f6f2cd1ce43990fb4fe6cd631967d0237e /works/solutions/leetcode/cpp/96.cpp | |
parent | 1cee979f5d36b311a03cc7397a036ba11caf3d42 (diff) | |
download | crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.tar.gz crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.tar.bz2 crupest-99e2e923d0c77b02f3fb4ff648ea916954868606.zip |
chore(store): move everything to store.
Diffstat (limited to 'works/solutions/leetcode/cpp/96.cpp')
-rw-r--r-- | works/solutions/leetcode/cpp/96.cpp | 14 |
1 files changed, 0 insertions, 14 deletions
diff --git a/works/solutions/leetcode/cpp/96.cpp b/works/solutions/leetcode/cpp/96.cpp deleted file mode 100644 index 3757baa..0000000 --- a/works/solutions/leetcode/cpp/96.cpp +++ /dev/null @@ -1,14 +0,0 @@ -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;
- }
-};
|