在lis中返回连续正数序列

Question

我需要返回列表中最长的正数序列。 目前我有：

def longestSequencePos(nums):
    longest_sequence = []
    current_sequence = []

    for obj in nums:
        if current_sequence and current_sequence[-1]+1 == obj:
            current_sequence.append(obj)
        else:
            current_sequence = [obj]
        if len(current_sequence) > len(longest_sequence):
            longest_sequence = current_sequence
    return sum(1 for obj in longest_sequence if obj > 0)

这只返回结果出现的正数的总数，所以当序列是5、8、12时它就不起作用了。任何帮助都将不胜感激。在

Answer 1

调查maximum subsequence问题。在