LeetCode Solutions
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
const int n = cost.size();
for (int i = 2; i < n; ++i)
cost[i] += min(cost[i - 1], cost[i - 2]);
return min(cost[n - 1], cost[n - 2]);
}
};
|
class Solution {
public int minCostClimbingStairs(int[] cost) {
final int n = cost.length;
for (int i = 2; i < n; ++i)
cost[i] += Math.min(cost[i - 1], cost[i - 2]);
return Math.min(cost[n - 1], cost[n - 2]);
}
}
|
class Solution:
def minCostClimbingStairs(self, cost: List[int]) -> int:
cost.append(0)
for i in range(2, len(cost)):
cost[i] += min(cost[i - 1], cost[i - 2])
return cost[-1]
|
