674. Longest Continuous Increasing Subsequence
Posted bernieloveslife
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了674. Longest Continuous Increasing Subsequence相关的知识,希望对你有一定的参考价值。
Given an unsorted array of integers, find the length of longest continuous
increasing subsequence.
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.
class Solution(object):
def findLengthOfLCIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
temp = 1
result = 1
if len(nums)==0:
return 0
for i in range(1,len(nums),1):
if nums[i]>nums[i-1]:
temp +=1
else:
temp = 1
result = max(result,temp)
return result
以上是关于674. Longest Continuous Increasing Subsequence的主要内容,如果未能解决你的问题,请参考以下文章
674. Longest Continuous Increasing Subsequence
674. Longest Continuous Increasing Subsequence@python
674. Longest Continuous Increasing Subsequence
674. Longest Continuous Increasing Subsequence