[update] 746

Author: Dream

README.md

@@ -60,7 +60,7 @@
 |804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/description/) | |Easy|
 |771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/description) | |Easy|
 |747|[Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/) | |Easy|
-|746|[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | |Easy|
+|746|[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | [Java_dream](./algorithms/minCostClimbingStairs/MinCostClimbingStairs.java)|Easy|
 |721|[Accounts Merge](https://leetcode.com/problems/accounts-merge/) | |Medium|
 |717|[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) | |Easy|
 |714|[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | |Medium|

algorithms/minCostClimbingStairs/MinCostClimbingStairs.java

@@ -0,0 +1,20 @@
+/**
+ * @author Dream
+ */
+public class MinCostClimbingStairs {
+    public int minCostClimbingStairs(int[] cost) {
+        if (cost == null || cost.length == 0) {
+            return 0;
+        }
+        if (cost.length == 1) {
+            return cost[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] = Math.min(dp[i - 1], dp[i - 2]) + cost[i];
+        }
+        return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
+    }
+}