＜Talk is cheap, show me the code 02＞ LeetCode.746 使用最小花费爬楼梯

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        // dp[i]: 到达下标为i的台阶所需支付的最小费用
        // dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        int l = cost.size();
        vector<int> dp(l + 1);
        dp[0] = 0;
        dp[1] = 0;
        for(int i = 2; i < l + 1; i ++){
            dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        }
        return dp[l];
    }
};