[674] Longest Continuous Increasing Subsequence

https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/

• algorithms
• Easy (43.20%)
• Source Code: 674.longest-continuous-increasing-subsequence.py
• Total Accepted: 63.2K
• Total Submissions: 143.3K
• Testcase Example: '[1,3,5,4,7]'

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
        lenn = len(nums)
        DP = [1] * lenn

        for i in range(1, lenn):
            if nums[i] > nums[i-1]:
                DP[i] = DP[i-1] + 1

        return max(DP)