feat: add typescript solution to lc problem: No.2291

No.2291.Maximum Profit From Trading Stocks

Author: zhaocchen

solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md

@@ -79,7 +79,16 @@ It can be shown that the maximum profit you can make is 0.
 ### **TypeScript**
 
 ```ts
-
+function maximumProfit(present: number[], future: number[], budget: number): number {
+    let packet = present.map((v, i) => [v, future[i] - v]);
+    let dp = new Array(budget + 1).fill(0);
+    for (let [v, w] of packet) {
+        for (let j = budget; j >= v; j--) {
+            dp[j] = Math.max(dp[j], dp[j - v] + w);
+        }
+    }
+    return dp[budget];
+};
 ```
 
 ### **...**

solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md

@@ -71,7 +71,16 @@ It can be shown that the maximum profit you can make is 0.
 ### **TypeScript**
 
 ```ts
-
+function maximumProfit(present: number[], future: number[], budget: number): number {
+    let packet = present.map((v, i) => [v, future[i] - v]);
+    let dp = new Array(budget + 1).fill(0);
+    for (let [v, w] of packet) {
+        for (let j = budget; j >= v; j--) {
+            dp[j] = Math.max(dp[j], dp[j - v] + w);
+        }
+    }
+    return dp[budget];
+};
 ```
 
 ### **...**

solution/2200-2299/2291.Maximum Profit From Trading Stocks/Solution.ts

@@ -0,0 +1,10 @@
+function maximumProfit(present: number[], future: number[], budget: number): number {
+    let packet = present.map((v, i) => [v, future[i] - v]);
+    let dp = new Array(budget + 1).fill(0);
+    for (let [v, w] of packet) {
+        for (let j = budget; j >= v; j--) {
+            dp[j] = Math.max(dp[j], dp[j - v] + w);
+        }
+    }
+    return dp[budget];
+};