From a8366adf1cbb7a8155a67f2d6d26db9a562acb6a Mon Sep 17 00:00:00 2001
From: wngtk <100271394+wngtk@users.noreply.github.com>
Date: Tue, 3 Oct 2023 17:49:16 +0800
Subject: [PATCH] =?UTF-8?q?Update=20=E8=83=8C=E5=8C=85=E7=90=86=E8=AE=BA?=
 =?UTF-8?q?=E5=9F=BA=E7=A1=8001=E8=83=8C=E5=8C=85-2.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Fix typo
---
 problems/背包理论基础01背包-2.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/背包理论基础01背包-2.md b/problems/背包理论基础01背包-2.md
index f60e261b..7827aa95 100644
--- a/problems/背包理论基础01背包-2.md
+++ b/problems/背包理论基础01背包-2.md
@@ -133,7 +133,7 @@ dp[1] = dp[1 - weight[0]] + value[0] = 15
 
 所以从后往前循环，每次取得状态不会和之前取得状态重合，这样每种物品就只取一次了。
 
-**那么问题又来了，为什么二维dp数组历的时候不用倒序呢？**
+**那么问题又来了，为什么二维dp数组遍历的时候不用倒序呢？**
 
 因为对于二维dp，dp[i][j]都是通过上一层即dp[i - 1][j]计算而来，本层的dp[i][j]并不会被覆盖！