package _674_longest_continuous_increasing_subsequence

func findLengthOfLCIS(nums []int) int {
	res, max := 1, 1
	l := len(nums)
	if l == 0 {
		return 0
	}

	for i := 1; i < l; i++ {
		if nums[i] > nums[i-1] {
			res++
		} else {
			res = 1
		}
		if res > max {
			max = res
		}
	}
	return max
}

{'avg_line_length': 13.5, 'max_line_length': 54, 'alphanum_fraction': 0.5555555555555556, 'licenses': ['MIT'], 'repository_name': 'youzeliang/goalgorithm', 'path': 'leetcode/easy/0674.longest-continuous-increasing-subsequence/longest-continuous-increasing-subsequence.go', 'size': 297, 'lang': 'GO'}