674. 最长连续递增序列

 1 class Solution(object):
 2     def findLengthOfLCIS(self, nums):
 3         """
 4         :type nums: List[int]
 5         :rtype: int
 6         """
 7         # nums为空
 8         if len(nums) == 0:
 9             return 0
10         # 存放各连续递增序列的长度，返回其最大值
11         res = []
12         # 记录各连续递增序列的长度
13         size = 1
14         for i in range(1, len(nums)):
15             if nums[i] > nums[i - 1]:
16                 size += 1
17             else:
18                 res.append(size)
19                 # 重置递增序列的长度
20                 size = 1
21         # 如果nums整体是个递增序列
22         res.append(size)
23         return max(res)
24 
25 
26 if __name__ == '__main__':
27     solution = Solution()
28     print(solution.findLengthOfLCIS([1, 3, 5, 7]))