674. Longest Continuous Increasing Subsequence

1. Question:

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

674. Longest Continuous Increasing Subsequence

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.

2. Solution:

class Solution(object):
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if nums is None:
            return 0
        size = len(nums)
        if size == 0:
            return 0

        if size == 1:
            return 1

        max_len = 1
        end = 1
        begin = 0
        while end < size:
            if nums[end - 1] < nums[end]:
                end += 1
                continue
            if end - begin > max_len:
                max_len = end - begin
            begin = end
            end += 1
        if end - begin > max_len:
            max_len = end - begin

        return max_len