Leetcode Link: 485. 最大连续 1 的个数 - 力扣(LeetCode)

题目

解法一

思路: 遇1加1,遇0更新res并重置

题解

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        cnt = 0  
        res = 0 # 结果
        for val in nums:
            if val == 1:
                cnt += 1
            else:
                res = max(cnt, res)
                cnt = 0
        res = max(res, cnt)
        return res