Min Cost Climbing Stairs LeetCode solution in Java

1
class Solution {
2
  public int minCostClimbingStairs(int[] cost) {
3
    int a[] = new int[cost.length + 1];
4
    a[0] = 0;
5
    a[1] = 0;
6

7
    for (int i = 2; i <= cost.length; i++) {
8
      a[i] = Math.min(cost[i - 1] + a[i - 1], cost[i - 2] + a[i - 2]);
9
    }
10
    return a[cost.length];
11
  }
12
}