746-Min-Cost-Climbing-Stairs

Sat 17 May 2025

https://leetcode.com/problems/min-cost-climbing-stairs

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def minCostClimbingStairs(self, cost: List[int]) -> int:
    cost.append(0)

    for i in range(2, len(cost)):
      cost[i] += min(cost[i - 1], cost[i - 2])

    return cost[-1]
new Solution().minCostClimbingStairs()

Score: 5

Category: leetcode