day28 2Q JIHO

Author: jihostudy

Jiho/Day28/Leetcode_70. Climbing Stairs.js

@@ -0,0 +1,11 @@
+var climbStairs = function (n) {
+  let arr = new Array(n + 1);
+  arr[1] = 1;
+  arr[2] = 2;
+  for (let i = 3; i <= n; i++) {
+    arr[i] = arr[i - 1] + arr[i - 2];
+  }
+  return arr[n];
+};
+
+console.log(climbStairs(10));

Jiho/Day28/Leetcode_746. Min Cost Climbing Stairs.js

@@ -0,0 +1,7 @@
+var minCostClimbingStairs = function (cost) {
+  for (let i = cost.length - 3; i >= 0; i--) {
+    cost[i] += Math.min(cost[i + 1], cost[i + 2]);
+  }
+
+  return Math.min(cost[0], cost[1]);
+};