diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index 37de9bbe..703e1dd6 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -174,6 +174,7 @@ const maxSubArray = nums => {
     // 数组长度，dp初始化
     const len = nums.length;
     let dp = new Array(len).fill(0);
+    dp[0] = nums[0];
     // 最大值初始化为dp[0]
     let max = dp[0];
     for (let i = 1; i < len; i++) {