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

zhaocchen · zhaocchen · commit 1d23987eb206 · 2022-04-06T14:37:40.000+08:00
No.0309.Best Time to Buy and Sell Stock with Cooldown
diff --git a/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/README.md b/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/README.md
@@ -98,6 +98,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```
+function maxProfit(prices: number[]): number {
+    const n = prices.length;
+    let dp = Array.from({ length: n }, v => new Array(3).fill(0));
+    dp[0] = [0, -prices[0], Number.MIN_SAFE_INTEGER];
+    for (let i = 1; i < n; i++) {
+        dp[i] = [
+            Math.max(dp[i - 1][0], dp[i - 1][2]),
+            Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]),
+            dp[i - 1][1] + prices[i]
+        ];
+    }
+    return Math.max(dp[n - 1][0], dp[n - 1][2]);
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/README_EN.md b/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/README_EN.md
@@ -73,6 +73,24 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```
+function maxProfit(prices: number[]): number {
+    const n = prices.length;
+    let dp = Array.from({ length: n }, v => new Array(3).fill(0));
+    dp[0] = [0, -prices[0], Number.MIN_SAFE_INTEGER];
+    for (let i = 1; i < n; i++) {
+        dp[i] = [
+            Math.max(dp[i - 1][0], dp[i - 1][2]),
+            Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]),
+            dp[i - 1][1] + prices[i]
+        ];
+    }
+    return Math.max(dp[n - 1][0], dp[n - 1][2]);
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/Solution.ts b/solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/Solution.ts
@@ -0,0 +1,13 @@
+function maxProfit(prices: number[]): number {
+    const n = prices.length;
+    let dp = Array.from({ length: n }, v => new Array(3).fill(0));
+    dp[0] = [0, -prices[0], Number.MIN_SAFE_INTEGER];
+    for (let i = 1; i < n; i++) {
+        dp[i] = [
+            Math.max(dp[i - 1][0], dp[i - 1][2]),
+            Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]),
+            dp[i - 1][1] + prices[i]
+        ];
+    }
+    return Math.max(dp[n - 1][0], dp[n - 1][2]);
+};
