feat: add typescript solution to lc problem: No.0122.Best Time to Buy…

… and Sell Stock II (doocs#525)
LiuXin19996 · Jul 18, 2021 · 214c212 · 214c212
1 parent 7061247
commit 214c212
Show file tree

Hide file tree

Showing 3 changed files with 31 additions and 0 deletions.
diff --git a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md
@@ -134,6 +134,18 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProfit(prices: number[]): number {
+    let ans = 0;
+    for (let i = 1; i < prices.length; i++) {
+        ans += Math.max(0, prices[i] - prices[i - 1]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 贪心：

diff --git a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md
@@ -110,6 +110,18 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxProfit(prices: number[]): number {
+    let ans = 0;
+    for (let i = 1; i < prices.length; i++) {
+        ans += Math.max(0, prices[i] - prices[i - 1]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 Greedy:

diff --git a/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/Solution.ts b/solution/0100-0199/0122.Best Time to Buy and Sell Stock II/Solution.ts
@@ -0,0 +1,7 @@
+function maxProfit(prices: number[]): number {
+    let ans = 0;
+    for (let i = 1; i < prices.length; i++) {
+        ans += Math.max(0, prices[i] - prices[i - 1]);
+    }
+    return ans;
+};