Update 746_Min_Cost_Climbing_Stairs.java

Author: Sean Prashad

Dynamic Programming/746_Min_Cost_Climbing_Stairs.java

@@ -1,17 +1,14 @@
 class Solution {
     public int minCostClimbingStairs(int[] cost) {
-        if (cost == null || cost.length == 0) {
-            return 0;
-        }
-
         int[] dp = new int[cost.length];
+
         dp[0] = cost[0];
         dp[1] = cost[1];
 
         for (int i = 2; i < cost.length; i++) {
             dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);
         }
 
-        return Math.min(dp[dp.length - 1], dp[dp.length - 2]);
+        return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
     }
 }