From 52ebd0882152d8994348b46de28bfd40cce87f7b Mon Sep 17 00:00:00 2001
From: nanhuaibeian <49868746+nanhuaibeian@users.noreply.github.com>
Date: Wed, 12 May 2021 20:51:36 +0800
Subject: [PATCH] =?UTF-8?q?Update=200746.=E4=BD=BF=E7=94=A8=E6=9C=80?=
 =?UTF-8?q?=E5=B0=8F=E8=8A=B1=E8=B4=B9=E7=88=AC=E6=A5=BC=E6=A2=AF.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0746.使用最小花费爬楼梯.md | 21 +++++++++++++++++++-
 1 file changed, 20 insertions(+), 1 deletion(-)

diff --git a/problems/0746.使用最小花费爬楼梯.md b/problems/0746.使用最小花费爬楼梯.md
index e87f782c..b8158205 100644
--- a/problems/0746.使用最小花费爬楼梯.md
+++ b/problems/0746.使用最小花费爬楼梯.md
@@ -203,7 +203,26 @@ public:
 
 
 Java：
-
+```Java
+class Solution {
+    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]);
+    }
+}
+```
 
 Python：