- Longest Continuous Increasing Subsequence Easy
444
94
Favorite
Share 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 a continuous 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.
思路：maxLength记录最大长度，current记录当前位置
代码：python3
class Solution:
def findLengthOfLCIS(self, nums: List[int]) -> int:
if len(nums)==0:return 0
current,maxl=1,0
for i in range(len(nums)-1):
if nums[i+1]<=nums[i]:
maxl=max(maxl,current)
current=1
else:
current+=1
return max(maxl,current)
