力扣746. 使用最小花费爬楼梯

#define  _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
using namespace std;


class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int len = cost.size();
        const int N = 10010;
        int dp[N];
        memset(dp, 0, sizeof(dp));
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= len; i++) {
            dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[len];
    }
};



int main() {
	return 0;
}