485. 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

给你一个二位数列表，求出列表最大的1连续的数目

思路：

很简单的列表遍历，要注意的就是最后一次遍历的值也要进行比较

 

结果：

class Solution(object):     def findMaxConsecutiveOnes(self, nums):         """         :type nums: List[int]         :rtype: int         """         max_num = 0         statistics = 0         # 遍历列表         for temp in nums:             if temp == 1:                 statistics += 1             else:                 if statistics > max_num:                     max_num = statistics                 statistics = 0         # 保证最后一遍也能进行比较         if statistics > max_num:             max_num = statistics         return max_num