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

修正0070.爬楼梯完全背包版本代码注释错误

Browse Source
This commit is contained in:
han854
2023-11-22 16:08:00 +08:00
parent 4c1491674a
commit 14906d78cb
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -100,8 +100,8 @@ int main() {
while (cin >> n >> m) { while (cin >> n >> m) {
vector<int> dp(n + 1, 0); vector<int> dp(n + 1, 0);
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 >= 0) dp[i] += dp[i - j]; if (i - j >= 0) dp[i] += dp[i - j];
} }
} }