LeetCode | 746. Min Cost Climbing Stairs | 简单DP上楼梯问题

746. Min Cost Climbing Stairs

My SubmissionsBack to Contest

·       User Accepted:995

·       User Tried:1160

·       Total Accepted:1014

·       Total Submissions:2144

·       Difficulty:Easy

On a staircase, the i-thstep has some non-negative cost cost[i] assigned (0 indexed).

Once you pay the cost, you can either climb one or twosteps. You need to find minimum cost to reach the top of the floor, and you caneither 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 thatcost 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 onlystep on 1s, skipping cost[3].

Note:

1.     cost will have a length inthe range [2, 1000].

2.     Every cost[i] will be an integer inthe range [0, 999].

其实就是水题，给你一个数组，每次走一步或者是走两步，问你当走完这个数组的时候，最少得到的值，

哎，我在做这题的时候想的太多了，导致最后居然没有做出来，以后在使用dp的时候记得dp数组和num数组的错位，以及dp的不符合公式的部分要加条件判断并且单独计算出来

class Solution {

public:

    #define REP(s,t) for(int i=s;i<=t;i++)

   intminCostClimbingStairs(vector<int>& cost) {

      int dp[1001] = { 0 }; dp[1] = cost[0];

      REP(2, cost.size())

      {

            dp[i] = min(dp[i - 1] + cost[i-1],dp[i - 2] + cost[i-1]);

      }

      return min(dp[cost.size()], dp[cost.size()- 1]);

}

};