algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2128 from Lozakaka/patch-20

Browse Source 
新增java註解
This commit is contained in:
程序员Carl
2023-06-28 10:04:34 +08:00
committed by GitHub
parent eb92cb04ab 17a01cecef
commit f975588825
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0070.爬楼梯完全背包版本.md
View File

@ -133,12 +133,13 @@ Java：
class Solution { class Solution {
public int climbStairs(int n) { public int climbStairs(int n) {
int[] dp = new int[n + 1]; int[] dp = new int[n + 1];
int m = 2; int m = 2; //有兩個物品：itme1重量爲一，item2重量爲二
dp[0] = 1; dp[0] = 1;
for (int i = 1; i <= n; i++) { // 遍历背包 for (int i = 1; i <= n; i++) { // 遍历背包
for (int j = 1; j <= m; j++) { //遍历物品 for (int j = 1; j <= m; j++) { //遍历物品
if (i >= j) dp[i] += dp[i - j]; if (i >= j) //當前的背包容量 大於 物品重量的時候，我們才需要記錄當前的這個裝得方法（方法數+）
dp[i] += dp[i - j];
} }
} }