We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2d6c5da commit cf12b63Copy full SHA for cf12b63
src/MinCostClimbingStairs.java
@@ -1,3 +1,7 @@
1
+// https://leetcode.com/problems/min-cost-climbing-stairs
2
+// T: O(n)
3
+// S: O(1)
4
+
5
public class MinCostClimbingStairs {
6
public int minCostClimbingStairs(int[] cost) {
7
int currentCost = cost[1], previousCost = cost[0], temp;
0 commit comments