python--leetcode485. Max Consecutive Ones

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

这一题非常地简单啊....题目意思就是给你一个list，里面只有0或者1，求1连续的最大次数。

直接上代码吧，不需要讲解：

class Solution(object):    def findMaxConsecutiveOnes(self, nums):        """        :type nums: List[int]        :rtype: int        """        max=0        count=0        for i in range(len(nums)):            if nums[i]==1:                count+=1                if count>max: max=count            if nums[i]==0:                count=0        return maxs=Solution()print(s.findMaxConsecutiveOnes([0,1,1,1,0,1,1]))