feat: add typescript solution to lc problem: No.0746.Min Cost Climbing Stairs (doocs#503)

zhaocchen · web-flow · commit 075480f2a1d6 · 2021-07-07T08:38:50.000+08:00
diff --git a/solution/0700-0799/0746.Min Cost Climbing Stairs/README.md b/solution/0700-0799/0746.Min Cost Climbing Stairs/README.md
@@ -77,6 +77,18 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minCostClimbingStairs(cost: number[]): number {
+    let a = 0, b = 0;
+    for (let i = 1; i < cost.length; ++i) {
+        [a, b] = [b, Math.min(a + cost[i - 1], b + cost[i])];
+    }
+    return b;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0700-0799/0746.Min Cost Climbing Stairs/README_EN.md b/solution/0700-0799/0746.Min Cost Climbing Stairs/README_EN.md
@@ -67,6 +67,18 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minCostClimbingStairs(cost: number[]): number {
+    let a = 0, b = 0;
+    for (let i = 1; i < cost.length; ++i) {
+        [a, b] = [b, Math.min(a + cost[i - 1], b + cost[i])];
+    }
+    return b;
+};
+```
+
 ### **C++**
 
 ```cpp
diff --git a/solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.ts b/solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.ts
@@ -0,0 +1,7 @@
+function minCostClimbingStairs(cost: number[]): number {
+    let a = 0, b = 0;
+    for (let i = 1; i < cost.length; ++i) {
+        [a, b] = [b, Math.min(a + cost[i - 1], b + cost[i])];
+    }
+    return b;
+};
