674. Longest Continuous Increasing Subsequence 最长连续增长的子序列

Posted 2020-10-06 Long Long Journey

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

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
        res = 1
        incNum = 1
        for i in range(1, len(nums)):
            if nums[i] > nums[i - 1]:
                incNum += 1
            else:
                res = max(incNum, res)
                incNum = 1
        return max(incNum, res)

来自为知笔记(Wiz)