Merge pull request #773 from Jerry-306/patch-11

更新 0053 最大子序和 JavaScript 解法
2021-09-24 10:08:52 +08:00 · 2021-09-24 10:08:52 +08:00 · 7081a0fa86
parent 9fa333e646 270757a277
commit 7081a0fa86
1 changed files with 2 additions and 1 deletions
--- 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++) {