algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
JaneyLin
2023-05-03 21:05:55 -04:00
committed by GitHub
parent ae3fc9f576
commit b794dccc5b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0674.最长连续递增序列.md
View File

@ -212,7 +212,7 @@ class Solution:
return 0 return 0
result = 1 result = 1
dp = [1] * len(nums) dp = [1] * len(nums)
for i in range(len(nums)): for i in range(len(nums)-1):
if nums[i+1] > nums[i]: #连续记录 if nums[i+1] > nums[i]: #连续记录
dp[i+1] = dp[i] + 1 dp[i+1] = dp[i] + 1
result = max(result, dp[i+1]) result = max(result, dp[i+1])