May 28, 2023 · May 3, 2023 · May 3, 2023 · May 4, 2023 · May 4, 2023 · May 28, 2023
diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -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])
Expand Down