Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
1 2 3 4
| 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出现的最大次数即可。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
| class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ res = [] count = 0 for i in nums: if (i == 1): count += 1 else: res.append(count) count = 0 res.append(count) return max(res)
|