easy peasy

Author: kanglicheng

Kangli/Arrays/longestContinuousIncreasingSubsequence

@@ -0,0 +1,13 @@
+class Solution(object):
+ def findLengthOfLCIS(self, nums):
+ if not nums:
+ return 0
+ count, ans = 1, 1
+ for i in range(1, len(nums)):
+ if nums[i] > nums[i-1]:
+ count += 1
+ else:
+ if ans < count:
+ ans = count
+ count = 1
+ return max(ans, count)