这种当前状态由前几个状态决定的问题都是动态规划。
class Solution {
public int minCostClimbingStairs(int[] cost) {
int[] dp = new int[cost.length+1];
dp[0] = 0;
dp[1] = 0;
for(int i = 2;i<dp.length;i++){
dp[i] = Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
}
return dp[dp.length-1];
}
}
改用变量存储:
class Solution {
public int minCostClimbingStairs(int[] cost) {
int dp0 = 0;
int dp1 = 0;
int dp = 0;
for(int i = 2;i<cost.length+1;i++){
dp = Math.min(dp1+cost[i-1],dp0+cost[i-2]);
dp0 = dp1;
dp1 = dp;
}
return dp;
}
}