代码仓库:Github | Leetcode solutions @doubleZ0108 from Peking University.
- 解法1(T36% S5%):标准的一维动态规划问题,新开辟一个dp数组初始化每个位置的最长连续序列长度都是1,从下标1开始循环,如果
nums[i]>nums[i-1]
,则dp[i] = dp[i-1]+1
,最后返回dp数组的最大值
class Solution:
def findLengthOfLCIS(self, nums: List[int]) -> int:
dp = [1 for _ in range(len(nums))]
for i in range(1, len(nums)):
if nums[i] > nums[i-1]:
dp[i] = dp[i-1] + 1
return max(dp)