leetcode - 485 - 最大连续1的个数

class Solution:
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        s = ""
        for i in nums:
            s += str(i)
        m = max([len(j) for j in s.split("0")])
        return m