From 22ac5d47548c0f6d8d1dcc2f0649c5bb297862c5 Mon Sep 17 00:00:00 2001
From: xin <oncwnuN1VCJ08Bt_EFHQkrbYfrSE@git.weixin.qq.com>
Date: Sat, 28 Oct 2023 18:31:15 +0800
Subject: [PATCH] =?UTF-8?q?fix:=200053.=E6=9C=80=E5=A4=A7=E5=AD=90?=
 =?UTF-8?q?=E5=BA=8F=E5=92=8C=E5=8E=9Ftypescript=E8=BF=87=E4=B8=8D?=
 =?UTF-8?q?=E4=BA=86leetcode=EF=BC=8C=E6=9B=B4=E6=96=B0=E4=BB=A3=E7=A0=81?=
 =?UTF-8?q?=E9=80=BB=E8=BE=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0053.最大子序和（动态规划）.md | 24 ++++++++++---------
 1 file changed, 13 insertions(+), 11 deletions(-)

diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index f1b64709..70ad7a84 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -226,18 +226,20 @@ object Solution {
 
 ```typescript
 function maxSubArray(nums: number[]): number {
-    /**
-        dp[i]：以nums[i]结尾的最大和
-     */
-    const dp: number[] = []
-    dp[0] = nums[0];
-    let resMax: number = 0;
-    for (let i = 1; i < nums.length; i++) {
-        dp[i] = Math.max(dp[i - 1] + nums[i], nums[i]);
-        resMax = Math.max(resMax, dp[i]);
+    const len = nums.length
+    if (len === 1) return nums[0]
+
+    const dp: number[] = new Array(len)
+    let resMax: number = dp[0] = nums[0]
+
+    for (let i = 1; i < len; i++) {
+        dp[i] = Math.max(dp[i - 1] + nums[i], nums[i])
+        // 注意值为负数的情况
+        if (dp[i] > resMax) resMax = dp[i]
     }
-    return resMax;
-};
+
+    return resMax
+}
 ```