Update Solution2.ts

yanglbme · web-flow · commit d9c7fd15d0bc · 2024-07-11T09:46:12.000+08:00
diff --git a/solution/0700-0799/0746.Min Cost Climbing Stairs/Solution2.ts b/solution/0700-0799/0746.Min Cost Climbing Stairs/Solution2.ts
@@ -1,8 +1,8 @@
 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])];
+    const n = cost.length;
+    const f: number[] = 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 b;
+    return f[n];
 }

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,8 @@`
`1`	`1`	`function minCostClimbingStairs(cost: number[]): number {`
`2`		`- let a = 0,`
`3`		`- b = 0;`
`4`		`- for (let i = 1; i < cost.length; ++i) {`
`5`		`- [a, b] = [b, Math.min(a + cost[i - 1], b + cost[i])];`
	`2`	`+ const n = cost.length;`
	`3`	`+ const f: number[] = Array(n + 1).fill(0);`
	`4`	`+ for (let i = 2; i <= n; ++i) {`
	`5`	`+ f[i] = Math.min(f[i - 1] + cost[i - 1], f[i - 2] + cost[i - 2]);`
`6`	`6`	`}`
`7`		`- return b;`
	`7`	`+ return f[n];`
`8`	`8`	`}`