From d6b1f3e9538c67b5592a0d93aee4df70a652ab96 Mon Sep 17 00:00:00 2001
From: JaneyLin <105125897+janeyziqinglin@users.noreply.github.com>
Date: Tue, 2 May 2023 23:28:44 -0400
Subject: [PATCH] =?UTF-8?q?Update=200674.=E6=9C=80=E9=95=BF=E8=BF=9E?=
 =?UTF-8?q?=E7=BB=AD=E9=80=92=E5=A2=9E=E5=BA=8F=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

fix bug.
---
 problems/0674.最长连续递增序列.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index 79a8311d..1e79b797 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -212,7 +212,7 @@ class Solution:
             return 0
         result = 1
         dp = [1] * len(nums)
-        for i in range(len(nums)-1):
+        for i in range(len(nums)):
             if nums[i+1] > nums[i]: #连续记录
                 dp[i+1] = dp[i] + 1
             result = max(result, dp[i+1])