674. Longest Continuous Increasing Subsequence（python+cpp）

题目：

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 
acontinuous 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.

解释：
挨个比较即可，当不满足条件的时候更新max_len，无需每次判断都更新，注意最后还要再比较一次，因为最会一个元素有可能是递增序列的最后一个元素。
python代码：

class Solution:
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        tmp=1
        max_len=1
        for i in range(1,len(nums)):
            if nums[i]>nums[i-1]:
                tmp+=1
            else:
                max_len=max(max_len,tmp)
                tmp=1
        return max(tmp,max_len)

总结：
注意最后还要再比较一次。