From e1b489d34caed9d9552f1585defbc6cece269215 Mon Sep 17 00:00:00 2001
From: qyg <1600314850@qq.com>
Date: Mon, 27 Dec 2021 09:54:39 +0800
Subject: [PATCH] =?UTF-8?q?0300.=E6=9C=80=E9=95=BF=E4=B8=8A=E5=8D=87?=
 =?UTF-8?q?=E5=AD=90=E5=BA=8F=E5=88=97=EF=BC=9A=E8=B0=83=E6=95=B4=E7=AC=94?=
 =?UTF-8?q?=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0300.最长上升子序列.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0300.最长上升子序列.md b/problems/0300.最长上升子序列.md
index 9c1c07f6..27d5b122 100644
--- a/problems/0300.最长上升子序列.md
+++ b/problems/0300.最长上升子序列.md
@@ -55,7 +55,7 @@
 
 dp[i] 是有0到i-1各个位置的最长升序子序列 推导而来，那么遍历i一定是从前向后遍历。
 
-j其实就是0到i-1，遍历i的循环里外层，遍历j则在内层，代码如下：
+j其实就是0到i-1，遍历i的循环在外层，遍历j则在内层，代码如下：
 
 ```CPP
 for (int i = 1; i < nums.size(); i++) {