diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/unique_bst.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/unique_bst.cpp')
-rw-r--r-- | other/unique_bst.cpp | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/other/unique_bst.cpp b/other/unique_bst.cpp new file mode 100644 index 0000000..7aefacd --- /dev/null +++ b/other/unique_bst.cpp @@ -0,0 +1,23 @@ +#include "leetcode.h" + +class Solution { +public: + int numTrees(int n) { + if (n == 1) + return 1; + vector<int> dp(n + 1); + dp[0] = dp[1] = 1; + for (int i = 2; i <= n; i++) { + for (int j = 0; j < i; j++) { + int k = i - 1 - j; + dp[i] += (dp[j] * dp[k]); + } + } + return dp[n]; + } +}; + +int main() { + Solution obj; + cout << obj.numTrees(3); +} |