[LeetCode&Python] Problem 674. Longest Continuous Increasing Subsequence
阿新 • • 發佈:2018-12-20
Given an unsorted array of integers, find the length of longest continuous
increasing subsequence (subarray).
Example 1:
Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 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.
Example 2:
Input: [2,2,2,2,2] Output: 1 Explanation: The longest continuous increasing subsequence is [2], its length is 1.
Note: Length of the array will not exceed 10,000.
class Solution(object): def findLengthOfLCIS(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 ans=1 count=1 n=len(nums) i=1 while i<n: if nums[i-1]<nums[i]: count+=1 else: if ans<count: ans=count count=1 i+=1 if ans<count: return count return ans