LeetCode746. Min Cost Climbing Stairs

本文介绍: 【代码】Lee tCo de746. Min Cos t Cli m bing St ai rs。

You ar e g i v en an integer array cost where cost[i] i s the cost of i th step on a sta i r case. Once y ou p a y the cost, y ou can ei ther cli mb one o r two step s.

You can either start fro m the step with index 0, or the step with index 1.

Return the mini mum cost to r each the top of the floor.

Ex ample 1:

Input: cost = [10,15,20]
Output: 15
Ex plan ation: You wi ll start at index 1.

class Solution {
public:
    int minCostClimbingStairs(vector<int&gt;&amp; cost) {
        int n = cost.size();
        vector<int&gt; dp(n + 1,0);
        dp[0] = 0;
        dp[1] = 0;
        for(int i = 2;i <= n;i++){
            dp[i] = min(cost[i-1] + dp[i-1],dp[i-2] + cost[i-2]);
        }
        return dp[n];
    }
};