思路:用一个累加器count,一旦遇到0就清零,否则就+1.用maxCount记录下count的最大值,即可知道序列中最长的连续1有多少.
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
maxCount, count = 0, 0
for num in nums:
if num == 0:
count = 0
else:
count += 1
maxCount = max(maxCount, count)
return maxCount
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
return max(len(l) for l in ''.join([str(num) for num in nums]).split('0'))