485. Max Consecutive Ones

来源:互联网 发布:linux开启端口监听 编辑:程序博客网 时间:2024/06/08 04:40

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

Example 1:

Input: [1,1,0,1,1,1]Output: 3Explanation: 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
Python 代码:
class Solution(object):    def findMaxConsecutiveOnes(self, nums):        """        :type nums: List[int]        :rtype: int        """        count = 0        max = 0        for i in nums:            if i == 1:                count += 1                if count > max:                    max = count            else:                count = 0        return max
0 0
原创粉丝点击