最长连续递增序列674

题目:给定一个未经排序的整数数组,找到最长且连续的的递增序列。

输入:[1,3,5,4,7]

输出:3

思路:单层for循环,递增数列记录,每次维护最长递增序列长度

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class (object):
def findLengthOfLCIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
res = 0
sub_res = 0
for i in range(len(nums)-1):
if nums[i+1]>nums[i]:
sub_res += 1
else:
sub_res = 0
res = max(res, sub_res)
return res+1
1
2
a = Solution().findLengthOfLCIS([2,2,2,2,2])
print(a)