lc485. Max Consecutive Ones

485. Max Consecutive Ones Easy

413

328

Favorite

Share Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3. Note:

The input array will only contain 0 and 1. The length of input array is a positive integer and will not exceed 10,000

思路：遍历 记录连续1最大值，并于当前最大值比较，大于当前值则替换

代码：python3

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        num = 0
        nmax=0
        for i in range(len(nums)):
            if nums[i] == 1:
                num=num+1
                nmax=max(num,nmax)
            else:
                num=0
        return nmax