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

Author: janeyziqinglin

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])