From eb2b5e756a3b0e2d92ee1bb0a0740ae9ccb9c64a Mon Sep 17 00:00:00 2001
From: qyg <1600314850@qq.com>
Date: Mon, 27 Dec 2021 09:53:51 +0800
Subject: [PATCH] =?UTF-8?q?0053.=E6=9C=80=E5=A4=A7=E5=AD=90=E5=BA=8F?=
 =?UTF-8?q?=E5=92=8C=EF=BC=88=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92=EF=BC=89?=
 =?UTF-8?q?=EF=BC=9A=E8=B0=83=E6=95=B4=E7=AC=94=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0053.最大子序和（动态规划）.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index 2e9d2fd5..37de9bbe 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -42,7 +42,7 @@ dp[i]只有两个方向可以推出来：
 
 dp[0]应该是多少呢?
 
-更具dp[i]的定义，很明显dp[0]因为为nums[0]即dp[0] = nums[0]。
+根据dp[i]的定义，很明显dp[0]应为nums[0]即dp[0] = nums[0]。
 
 4. 确定遍历顺序