diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/unique_bst.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/unique_bst.cpp')
-rw-r--r-- | other/unique_bst.cpp | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/other/unique_bst.cpp b/other/unique_bst.cpp deleted file mode 100644 index 7aefacd..0000000 --- a/other/unique_bst.cpp +++ /dev/null @@ -1,23 +0,0 @@ -#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); -} |