题解 | 最小花费爬楼梯

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        // write code here
        if(cost.size()<=2){
            return 0;
        }
        int first=0;
        int second=0;
        for(int i=2;i<=cost.size();i++){
            int temp=min(first+cost[i-2],second+cost[i-1]);
            if(i==cost.size()){
                return temp;
            }
            first=second;
            second=temp;
        }
        return 0;
    }
};