python leetcode 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
        """
        nums = ''.join(str(each) for each in nums)
        nums = nums.split('0')
        ans = 0
        for i in range(len(nums)):
            ans = max(ans, len(nums[i]))
        return ans