From af1a2249c0b61827a4d331ca7e23904e48383bba Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= Date: Fri, 2 Oct 2026 21:40:18 +0900 Subject: [PATCH 1/2] =?UTF-8?q?10/2=20=EC=BD=94=ED=85=8C?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../746.Min Cost Climbing Stairs.js" | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 "leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" new file mode 100644 index 000000000..e69de29bb From 5e0adaa9aafcce9c10010d33b5349226e3ed9989 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= Date: Fri, 2 Oct 2026 22:14:10 +0900 Subject: [PATCH 2/2] 746. Min Cost Climbing Stairs --- .../746.Min Cost Climbing Stairs.js" | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" index e69de29bb..4bed2dc57 100644 --- "a/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" +++ "b/leetcode3/\352\271\200\355\235\254\354\206\214/746.Min Cost Climbing Stairs.js" @@ -0,0 +1,29 @@ +/** + * @param {number[]} cost + * @return {number} + */ + +// 계단을 오르는데 드는 최소 비용을 구하는 문제, +// 시작 지점 : 인덱스 0 또한 인덱스 1 + +// 인덱스 0 혹은 1을 골랐을 때의 각각 최소비용을 비교해서 정해야? + +var minCostClimbingStairs = function(cost) { + const minCost = []; + + if (cost.length === 2) { + return Math.min(...cost) + } + + minCost[0] = cost[0]; + minCost[1] = cost[1]; + + for (let i = 2; i < cost.length; i++) { + minCost[i] = Math.min(minCost[i -1], minCost[i - 2]) + cost[i]; + } + + return Math.min( + minCost[cost.length -1], + minCost[cost.length -2] + ) +}; \ No newline at end of file