[LeetCode] 746. Min Cost Climbing Stairs - Java

• 문제 링크

Min Cost Climbing Stairs - LeetCode

 

• 풀이 코드

public class Solution {

    public int minCostClimbingStairs(int[] cost) {
        int a = cost[0], b = cost[1];
        for (int i = 2; i < cost.length; i++) {
            int c = cost[i] + Math.min(a, b);
            a = b;
            b = c;
        }

        return Math.min(a, b);
    }

}