Update 0674.最长连续递增序列.md

2023-05-03 21:05:55 -04:00 · 2023-05-03 21:05:55 -04:00 · b794dccc5b
parent ae3fc9f576
commit b794dccc5b
1 changed files with 1 additions and 1 deletions
--- 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)):
+        for i in range(len(nums)-1):
            if nums[i+1] > nums[i]: #连续记录
                dp[i+1] = dp[i] + 1
            result = max(result, dp[i+1])