feat: add js solution to lc problem: No.0746

Author: rain84

solution/0700-0799/0746.Min Cost Climbing Stairs/README.md

@@ -152,6 +152,19 @@ function minCostClimbingStairs(cost: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const f = Array(n + 1).fill(0);
+    for (let i = 2; i <= n; ++i) {
+        f[i] = Math.min(f[i - 1] + cost[i - 1], f[i - 2] + cost[i - 2]);
+    }
+    return f[n];
+}
+```
+
 #### Rust
 
 ```rust

solution/0700-0799/0746.Min Cost Climbing Stairs/README_EN.md

@@ -150,6 +150,19 @@ function minCostClimbingStairs(cost: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const f = Array(n + 1).fill(0);
+    for (let i = 2; i <= n; ++i) {
+        f[i] = Math.min(f[i - 1] + cost[i - 1], f[i - 2] + cost[i - 2]);
+    }
+    return f[n];
+}
+```
+
 #### Rust
 
 ```rust

solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.js

@@ -0,0 +1,8 @@
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const f = Array(n + 1).fill(0);
+    for (let i = 2; i <= n; ++i) {
+        f[i] = Math.min(f[i - 1] + cost[i - 1], f[i - 2] + cost[i - 2]);
+    }
+    return f[n];
+}