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