【动归】746. Min Cost Climbing Stairs

f(n)=min(f(n-1)+a[n-1],f(n-2)+a[n-2]),f(0)=0,f(1)=1

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        vector<int> table; 	
        table.push_back(0);
        table.push_back(0);
        int i=2;
        while(i<=cost.size())
        {
            int temp=min(table[i-1]+cost[i-1],cost[i-2]+table[i-2]);
            table.push_back(temp);
            i++;
        }
        return table[cost.size()];
    }
};