feat: add solutions to lc problem: No.0790 (#4389)

No.0790.Domino and Tromino Tiling

Author: yanglbme

solution/0700-0799/0790.Domino and Tromino Tiling/README.md

@@ -86,7 +86,7 @@ tags:
 
 注意，过程中的状态数值可能会很大，因此需要对 $10^9+7$ 取模。
 
-时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为面板的列数。
+时间复杂度 $O(n)$，其中 $n$ 为面板的列数。空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
@@ -132,12 +132,11 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    const int mod = 1e9 + 7;
-
     int numTilings(int n) {
-        long f[4] = {1, 0, 0, 0};
+        const int mod = 1e9 + 7;
+        long long f[4] = {1, 0, 0, 0};
         for (int i = 1; i <= n; ++i) {
-            long g[4] = {0, 0, 0, 0};
+            long long g[4];
             g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
             g[1] = (f[2] + f[3]) % mod;
             g[2] = (f[1] + f[3]) % mod;
@@ -168,6 +167,46 @@ func numTilings(n int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function numTilings(n: number): number {
+    const mod = 1_000_000_007;
+    let f: number[] = [1, 0, 0, 0];
+
+    for (let i = 1; i <= n; ++i) {
+        const g: number[] = Array(4);
+        g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
+        g[1] = (f[2] + f[3]) % mod;
+        g[2] = (f[1] + f[3]) % mod;
+        g[3] = f[0] % mod;
+        f = g;
+    }
+
+    return f[0];
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn num_tilings(n: i32) -> i32 {
+        const MOD: i64 = 1_000_000_007;
+        let mut f: [i64; 4] = [1, 0, 0, 0];
+        for _ in 1..=n {
+            let mut g = [0i64; 4];
+            g[0] = (f[0] + f[1] + f[2] + f[3]) % MOD;
+            g[1] = (f[2] + f[3]) % MOD;
+            g[2] = (f[1] + f[3]) % MOD;
+            g[3] = f[0] % MOD;
+            f = g;
+        }
+        f[0] as i32
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0790.Domino and Tromino Tiling/README_EN.md

@@ -126,12 +126,11 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    const int mod = 1e9 + 7;
-
     int numTilings(int n) {
-        long f[4] = {1, 0, 0, 0};
+        const int mod = 1e9 + 7;
+        long long f[4] = {1, 0, 0, 0};
         for (int i = 1; i <= n; ++i) {
-            long g[4] = {0, 0, 0, 0};
+            long long g[4];
             g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
             g[1] = (f[2] + f[3]) % mod;
             g[2] = (f[1] + f[3]) % mod;
@@ -162,6 +161,46 @@ func numTilings(n int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function numTilings(n: number): number {
+    const mod = 1_000_000_007;
+    let f: number[] = [1, 0, 0, 0];
+
+    for (let i = 1; i <= n; ++i) {
+        const g: number[] = Array(4);
+        g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
+        g[1] = (f[2] + f[3]) % mod;
+        g[2] = (f[1] + f[3]) % mod;
+        g[3] = f[0] % mod;
+        f = g;
+    }
+
+    return f[0];
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn num_tilings(n: i32) -> i32 {
+        const MOD: i64 = 1_000_000_007;
+        let mut f: [i64; 4] = [1, 0, 0, 0];
+        for _ in 1..=n {
+            let mut g = [0i64; 4];
+            g[0] = (f[0] + f[1] + f[2] + f[3]) % MOD;
+            g[1] = (f[2] + f[3]) % MOD;
+            g[2] = (f[1] + f[3]) % MOD;
+            g[3] = f[0] % MOD;
+            f = g;
+        }
+        f[0] as i32
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0790.Domino and Tromino Tiling/Solution.cpp

@@ -1,11 +1,10 @@
 class Solution {
 public:
-    const int mod = 1e9 + 7;
-
     int numTilings(int n) {
-        long f[4] = {1, 0, 0, 0};
+        const int mod = 1e9 + 7;
+        long long f[4] = {1, 0, 0, 0};
         for (int i = 1; i <= n; ++i) {
-            long g[4] = {0, 0, 0, 0};
+            long long g[4];
             g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
             g[1] = (f[2] + f[3]) % mod;
             g[2] = (f[1] + f[3]) % mod;

solution/0700-0799/0790.Domino and Tromino Tiling/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn num_tilings(n: i32) -> i32 {
+        const MOD: i64 = 1_000_000_007;
+        let mut f: [i64; 4] = [1, 0, 0, 0];
+        for _ in 1..=n {
+            let mut g = [0i64; 4];
+            g[0] = (f[0] + f[1] + f[2] + f[3]) % MOD;
+            g[1] = (f[2] + f[3]) % MOD;
+            g[2] = (f[1] + f[3]) % MOD;
+            g[3] = f[0] % MOD;
+            f = g;
+        }
+        f[0] as i32
+    }
+}

solution/0700-0799/0790.Domino and Tromino Tiling/Solution.ts

@@ -0,0 +1,15 @@
+function numTilings(n: number): number {
+    const mod = 1_000_000_007;
+    let f: number[] = [1, 0, 0, 0];
+
+    for (let i = 1; i <= n; ++i) {
+        const g: number[] = Array(4);
+        g[0] = (f[0] + f[1] + f[2] + f[3]) % mod;
+        g[1] = (f[2] + f[3]) % mod;
+        g[2] = (f[1] + f[3]) % mod;
+        g[3] = f[0] % mod;
+        f = g;
+    }
+
+    return f[0];
+}