From 14906d78cb92a8bbfd034634c80daf1a5fa355f0 Mon Sep 17 00:00:00 2001
From: han854 <1229369094@qq.com>
Date: Wed, 22 Nov 2023 16:08:00 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=AD=A30070.=E7=88=AC=E6=A5=BC?=
 =?UTF-8?q?=E6=A2=AF=E5=AE=8C=E5=85=A8=E8=83=8C=E5=8C=85=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81=E6=B3=A8=E9=87=8A=E9=94=99=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0070.爬楼梯完全背包版本.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/problems/0070.爬楼梯完全背包版本.md b/problems/0070.爬楼梯完全背包版本.md
index 0da1ebec..26af2569 100644
--- a/problems/0070.爬楼梯完全背包版本.md
+++ b/problems/0070.爬楼梯完全背包版本.md
@@ -100,8 +100,8 @@ int main() {
     while (cin >> n >> m) {
         vector<int> dp(n + 1, 0);
         dp[0] = 1;
-        for (int i = 1; i <= n; i++) { // 遍历物品
-            for (int j = 1; j <= m; j++) { // 遍历背包
+        for (int i = 1; i <= n; i++) { // 遍历背包
+            for (int j = 1; j <= m; j++) { // 遍历物品
                 if (i - j >= 0) dp[i] += dp[i - j];
             }
         }