<qiyuangong>674_Longest_Continuous_Increasing_Subsequence_1.py
def findLengthOfLCIS( nums):
    if not nums or len(nums) == 0:
        return 0
    ans = curr = 1
    for i in range(len(nums) - 1):
        if nums[i] < nums[i + 1]:
            curr += 1
            ans = max(ans, curr)
        else:
            curr = 1
    return ans
def sample_funcname ( var_0 ) :
    if not var_0 or len ( var_0 ) == 0 :
        return 0
    var_5 = var_3 = 1
    for var_7 in range ( len ( var_0 ) - 1 ) :
        if var_0 [ var_7 ] < var_0 [ var_7 + 1 ] :
            var_3 += 1
            var_5 = max ( var_5 , var_3 )
        else :
            var_3 = 1
    return var_5
