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/domino_tromino_tiling.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/domino_tromino_tiling.cpp')
-rw-r--r-- | other/domino_tromino_tiling.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/domino_tromino_tiling.cpp b/other/domino_tromino_tiling.cpp deleted file mode 100644 index 80a97d0..0000000 --- a/other/domino_tromino_tiling.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" -#include <vector> - -class Solution { -public: - int numTilings(int n) { - int mod = 1e9; - mod += 7; - vector<long long> ans(1001, 0); - ans[1] = 1; - ans[2] = 2; - ans[3] = 5; - if (n <= 3) - return ans[n]; - for (int i = 4; i <= n; ++i) { - ans[i] = 2 * ans[i - 1] + ans[i - 3]; - ans[i] %= mod; - } - return ans[n]; - } -}; - -int main() { - Solution obj; - cout << obj.numTilings(3); // 5 - cout << endl; - cout << obj.numTilings(1); // 1 -} |