We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e1b93d6 commit 91b52fdCopy full SHA for 91b52fd
src/main/java/com/fishercoder/solutions/_746.java
@@ -7,7 +7,7 @@ public int minCostClimbingStairs(int[] cost) {
7
dp[0] = cost[0];
8
dp[1] = cost[1];
9
for (int i = 2; i < cost.length; i++) {
10
- dp[i] = Math.min(dp[i - 1] + cost[i], dp[i - 2] + cost[i]);
+ dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);
11
}
12
return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
13
0 commit comments