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

Author: rain84

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

@@ -292,6 +292,26 @@ function minCostClimbingStairs(cost: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = i => {
+        if (i <= 1) return cost[i];
+        if (cache[i] !== undefined && cache[i] !== -1) return cache[i];
+
+        cache[i] = (cost[i] ?? 0) + Math.min(fn(i - 1), fn(i - 2));
+
+        return cache[i];
+    };
+
+    return fn(n);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -290,6 +290,26 @@ function minCostClimbingStairs(cost: number[]): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = i => {
+        if (i <= 1) return cost[i];
+        if (cache[i] !== undefined && cache[i] !== -1) return cache[i];
+
+        cache[i] = (cost[i] ?? 0) + Math.min(fn(i - 1), fn(i - 2));
+
+        return cache[i];
+    };
+
+    return fn(n);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,15 @@
+function minCostClimbingStairs(cost) {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = i => {
+        if (i <= 1) return cost[i];
+        if (cache[i] !== undefined && cache[i] !== -1) return cache[i];
+
+        cache[i] = (cost[i] ?? 0) + Math.min(fn(i - 1), fn(i - 2));
+
+        return cache[i];
+    };
+
+    return fn(n);
+}