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

Author: rain84

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

@@ -266,4 +266,34 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Dynamic Programming. Recursion and top-down approach
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minCostClimbingStairs(cost: number[]): number {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = (i: number): number => {
+        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 -->
+
 <!-- problem:end -->

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

@@ -264,4 +264,34 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Dynamic Programming. Recursion and top-down approach
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minCostClimbingStairs(cost: number[]): number {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = (i: number): number => {
+        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 -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,15 @@
+function minCostClimbingStairs(cost: number[]): number {
+    const n = cost.length;
+    const cache = Array(n).fill(-1);
+
+    const fn = (i: number): number => {
+        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);
+}