From 17a01cecefcdb2b71806a56bc6789686bcb755ac Mon Sep 17 00:00:00 2001 From: Terry Liu <102352821+Lozakaka@users.noreply.github.com> Date: Thu, 8 Jun 2023 17:38:49 -0400 Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9Ejava=E8=A8=BB=E8=A7=A3?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 新增java註解 if statement的解釋 --- problems/0070.爬楼梯完全背包版本.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/problems/0070.爬楼梯完全背包版本.md b/problems/0070.爬楼梯完全背包版本.md index 8f8bc9a6..bc5e3509 100644 --- a/problems/0070.爬楼梯完全背包版本.md +++ b/problems/0070.爬楼梯完全背包版本.md @@ -133,12 +133,13 @@ Java: class Solution { public int climbStairs(int n) { int[] dp = new int[n + 1]; - int m = 2; + int m = 2; //有兩個物品:itme1重量爲一,item2重量爲二 dp[0] = 1; for (int i = 1; i <= n; i++) { // 遍历背包 for (int j = 1; j <= m; j++) { //遍历物品 - if (i >= j) dp[i] += dp[i - j]; + if (i >= j) //當前的背包容量 大於 物品重量的時候,我們才需要記錄當前的這個裝得方法(方法數+) + dp[i] += dp[i - j]; } }