LeetCode--Python解析【Longest Continuous Increasing Subsequence】(674)

题目：

方法：

class Solution:
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        res = nums[0]
        temp = 1
        max_temp = 1
        for n in range(1,len(nums)):
            if nums[n] > res :
                temp += 1
                max_temp = max(temp,max_temp)
            else:
                temp = 1
            res = nums[n]
        return max_temp

从数组的第二个元素开始比较

temp用来记录当前递增元素的个数

max_temp记录递增元素最大个数

若出现递减元素，temp置1