746. Min Cost Climbing Stairs（python+cpp）

题目：

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.
Example 1:

Input: cost = [10, 15, 20] 
Output: 15 
Explanation: Cheapest is start on cost[1], pay that cost and go to the top. 

Example 2:

Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1] 
Output: 6
Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3]. 

Note:
cost will have a length in the range [2,1000].
Every cost[i] will be an integer in the range[0, 999].

解释：
动态规划问题，顶层表示数组的最后一个元素的再后面一个，用一个数组dp[]来储存到达第i层所需的总花费，由于可以从第0层或者第一层开始，则dp[0]=0,dp[1]=0,cost[0]=1,cost[1]=100（对于题目所给示例而言）,从第2层开始，dp[i]可以通过从i-1走1层或者从i-2走2层的方式得到,所以dp[i]=min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2])。
dp(len(cost))为最终的结果。

python代码：

class Solution:
    def minCostClimbingStairs(self, cost):
        """
        :type cost: List[int]
        :rtype: int
        """
        #dp[i]表示到达第i层需要华花费的费用
        dp=[0]*(len(cost)+1)
        for i in range(2,len(dp)):
            dp[i]=min(cost[i-2]+dp[i-2],cost[i-1]+dp[i-1])
        return dp[-1]

c++代码：

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

总结：
动态规划啊动态规划～～