Given a binary array
nums, return the maximum number of consecutive
1‘s in the array.
Input: nums = [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.
Input: nums = [1,0,1,1,0,1] Output: 2
1 <= nums.length <= 105
Iterate the list and count the consecutive ones.
class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: max_count = 0 count = 0 for num in nums: if num == 1: count += 1 else: max_count = max(max_count, count) count = 0 return max(max_count, count)
- Time Complexity: O(N).
- Space Complexity: O(1).