Leetcode 674. Longest Continuous Increasing Subsequence

Seawolf

1. Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
   
2. 
   
3. Example 1:
   
4. Input: [1,3,5,4,7]
   
5. Output: 3
   
6. Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
   
7. Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4.
   
8. Example 2:
   
9. Input: [2,2,2,2,2]
   
10. Output: 1
    
11. Explanation: The longest continuous increasing subsequence is [2], its length is 1.
    
12. Note: Length of the array will not exceed 10,000.

复制代码

1. class Solution:
   
2.     def findLengthOfLCIS(self, nums: List[int]) -> int:
   
3.         if nums == None or len(nums) == 0:
   
4.             return 0
   
5.         count = 1
   
6.         res = 1
   
7.         for i in range(1, len(nums)):
   
8.             if nums[i] > nums[i - 1]:
   
9.                 count += 1
   
10.             else:
    
11.                 count = 1
    
12.             res = max(res, count)
    
13.         return res

复制代码