Given a binary array, find the maximum number of consecutive 1s in this array.
给定一二进制序列，找出其中最大的连续为1的序列的元素数目。
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
注：
- 输入序列只包含0和1
- 输入序列的长度为正整数且不会超过10000
思路：
class Solution(object):
def findMaxConsecutiveOnes(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
res=0
cur=0
for i in nums:
if i==1:
cur+=1
else:
cur=0
if cur>res:
res=cur
return res
