746. Min Cost Climbing Stairs - LeetCode Solution

class Solution:
    def minCostClimbingStairs(self, cost: List[int]) -> int:

        ans = [cost[0] , cost[1]]

        if len(cost) == 2:
            return min(ans)



        for i in range(2, len(cost), 1):
            a = ans[-1]
            b = ans[-2]

            ans.append(min(a, b) + cost[i])
        
        return min(ans[-1], ans[-2])