leetcode 485. Max Consecutive Ones

485. Max Consecutive Ones

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

class Solution():

    def findMaxConsecutiveOnes(self, nums):

        """

        :type nums: List[int]

        :rtype: int

        """

        s=''.join([str(i) for i in nums])

        return max(map(len,s.split('0')))

    def findMaxConsecutiveOnes1(self,nums):

        count1 = 0;

        result= 0

        for i in nums:

            if i==1:

                count1+=1

                result=max(count1,result)

            elif i==0:

                count1=0

        return result

s=Solution()

print s.findMaxConsecutiveOnes1([1,1,1,0,1])