feat: add solutions to lc problem: No.2585

No.2585.Number of Ways to Earn Points

Author: yanglbme

README_EN.md

@@ -14,7 +14,9 @@
 
 ## Introduction
 
-Complete solutions to LeetCode, LCOF and LCCI problems, updated daily. Please give me a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
+The Doocs LeetCode repository is a comprehensive collection of solutions to LeetCode questions in multiple programming languages. The repository contains solutions to LeetCode, LCOF, LCCI questions, and more in multiple programming languages.
+
+The repository is maintained by the Doocs community, and please give us a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
 
 [中文文档](/README.md)
 

solution/2500-2599/2585.Number of Ways to Earn Points/README.md

@@ -181,6 +181,28 @@ func waysToReachTarget(target int, types [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function waysToReachTarget(target: number, types: number[][]): number {
+    const n = types.length;
+    const mod = 10 ** 9 + 7;
+    const f: number[][] = Array.from({ length: n + 1 }, () => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    for (let i = 1; i <= n; ++i) {
+        const [count, marks] = types[i - 1];
+        for (let j = 0; j <= target; ++j) {
+            for (let k = 0; k <= count; ++k) {
+                if (j >= k * marks) {
+                    f[i][j] = (f[i][j] + f[i - 1][j - k * marks]) % mod;
+                }
+            }
+        }
+    }
+    return f[n][target];
+};
+```
+
 ### **...**
 
 ```

solution/2500-2599/2585.Number of Ways to Earn Points/README_EN.md

@@ -161,6 +161,28 @@ func waysToReachTarget(target int, types [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function waysToReachTarget(target: number, types: number[][]): number {
+    const n = types.length;
+    const mod = 10 ** 9 + 7;
+    const f: number[][] = Array.from({ length: n + 1 }, () => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    for (let i = 1; i <= n; ++i) {
+        const [count, marks] = types[i - 1];
+        for (let j = 0; j <= target; ++j) {
+            for (let k = 0; k <= count; ++k) {
+                if (j >= k * marks) {
+                    f[i][j] = (f[i][j] + f[i - 1][j - k * marks]) % mod;
+                }
+            }
+        }
+    }
+    return f[n][target];
+};
+```
+
 ### **...**
 
 ```

solution/2500-2599/2585.Number of Ways to Earn Points/Solution.ts

@@ -0,0 +1,17 @@
+function waysToReachTarget(target: number, types: number[][]): number {
+    const n = types.length;
+    const mod = 10 ** 9 + 7;
+    const f: number[][] = Array.from({ length: n + 1 }, () => Array(target + 1).fill(0));
+    f[0][0] = 1;
+    for (let i = 1; i <= n; ++i) {
+        const [count, marks] = types[i - 1];
+        for (let j = 0; j <= target; ++j) {
+            for (let k = 0; k <= count; ++k) {
+                if (j >= k * marks) {
+                    f[i][j] = (f[i][j] + f[i - 1][j - k * marks]) % mod;
+                }
+            }
+        }
+    }
+    return f[n][target];
+};