# LeetCode - 0746. Min Cost Climbing Stairs
### 題目網址：https://leetcode.com/problems/min-cost-climbing-stairs/
###### tags: `LeetCode` `Easy` `動態規劃（Dynamic Programming）`

/*
    -LeetCode format-
    Problem: 746. Min Cost Climbing Stairs
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        cost.push_back(0);
        int first = cost[0], second = cost[1], buffer;
        for (int i = 2; i != cost.size(); ++i) {
            buffer = cost[i] + min(first, second);
            first = second; second = buffer;
        }
        return second;
    }
};