674. Longest Continuous Increasing Subsequence@python
2021-06-15 08:07
标签：ret turn problems als one solution tin output code Given an unsorted array of integers, find the length of longest Example 1: 题目地址: Longest Continuous Increasing Subsequence 难度: Easy 题意: 找出呈递增的趋势的子数组,返回最大长度 思路: 遍历数组,并计数,比较简单 时间复杂度: O(n) 空间复杂度: O(1) 674. Longest Continuous Increasing Subsequence@python 标签：ret turn problems als one solution tin output code 原文地址：https://www.cnblogs.com/chimpan/p/9732975.htmlcontinuous increasing subsequence (subarray).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.
class Solution(object):
def findLengthOfLCIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
n = len(nums)
if n :
return len(nums)
res = 0
length = 1
for i in range(n-1):
if nums[i] ]:
length += 1
else:
res = max(length, res)
length = 1
res = max(length, res)
return res
文章标题：674. Longest Continuous Increasing Subsequence@python
文章链接：http://soscw.com/index.php/essay/94108.html