feat: add solutions to lc problem: No.1155

No.1155. Number of Dice Rolls With Target Sum

Author: yanglbme

solution/1100-1199/1155.Number of Dice Rolls With Target Sum/README.md

@@ -91,15 +91,14 @@ class Solution:
 
 ```java
 class Solution {
-    private static final int MOD = (int) 1e9 + 7;
-
     public int numRollsToTarget(int n, int k, int target) {
+        final int mod = (int) 1e9 + 7;
         int[][] f = new int[n + 1][target + 1];
         f[0][0] = 1;
         for (int i = 1; i <= n; ++i) {
             for (int j = 1; j <= Math.min(target, i * k); ++j) {
                 for (int h = 1; h <= Math.min(j, k); ++h) {
-                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % MOD;
+                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
                 }
             }
         }
@@ -158,6 +157,26 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numRollsToTarget(n: number, k: number, target: number): number {
+    const f = Array(n + 1)
+        .fill(0)
+        .map(() => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    const mod = 1e9 + 7;
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j <= Math.min(i * k, target); ++j) {
+            for (let h = 1; h <= Math.min(j, k); ++h) {
+                f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
+            }
+        }
+    }
+    return f[n][target];
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1155.Number of Dice Rolls With Target Sum/README_EN.md

@@ -66,15 +66,14 @@ class Solution:
 
 ```java
 class Solution {
-    private static final int MOD = (int) 1e9 + 7;
-
     public int numRollsToTarget(int n, int k, int target) {
+        final int mod = (int) 1e9 + 7;
         int[][] f = new int[n + 1][target + 1];
         f[0][0] = 1;
         for (int i = 1; i <= n; ++i) {
             for (int j = 1; j <= Math.min(target, i * k); ++j) {
                 for (int h = 1; h <= Math.min(j, k); ++h) {
-                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % MOD;
+                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
                 }
             }
         }
@@ -133,6 +132,26 @@ func min(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numRollsToTarget(n: number, k: number, target: number): number {
+    const f = Array(n + 1)
+        .fill(0)
+        .map(() => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    const mod = 1e9 + 7;
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j <= Math.min(i * k, target); ++j) {
+            for (let h = 1; h <= Math.min(j, k); ++h) {
+                f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
+            }
+        }
+    }
+    return f[n][target];
+}
+```
+
 ### **...**
 
 ```

solution/1100-1199/1155.Number of Dice Rolls With Target Sum/Solution.java

@@ -1,13 +1,12 @@
 class Solution {
-    private static final int MOD = (int) 1e9 + 7;
-
     public int numRollsToTarget(int n, int k, int target) {
+        final int mod = (int) 1e9 + 7;
         int[][] f = new int[n + 1][target + 1];
         f[0][0] = 1;
         for (int i = 1; i <= n; ++i) {
             for (int j = 1; j <= Math.min(target, i * k); ++j) {
                 for (int h = 1; h <= Math.min(j, k); ++h) {
-                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % MOD;
+                    f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
                 }
             }
         }

solution/1100-1199/1155.Number of Dice Rolls With Target Sum/Solution.ts

@@ -0,0 +1,15 @@
+function numRollsToTarget(n: number, k: number, target: number): number {
+    const f = Array(n + 1)
+        .fill(0)
+        .map(() => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    const mod = 1e9 + 7;
+    for (let i = 1; i <= n; ++i) {
+        for (let j = 1; j <= Math.min(i * k, target); ++j) {
+            for (let h = 1; h <= Math.min(j, k); ++h) {
+                f[i][j] = (f[i][j] + f[i - 1][j - h]) % mod;
+            }
+        }
+    }
+    return f[n][target];
+}