【leetcode】最大连续1的个数合集

最大连续1的个数合集

（简单）问题描述：

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        n = 0
        l = []
        for i in range(len(nums)):
            if nums[i] == 1:
                n += 1
            else:
                l.append(n)
                n = 0
        l.append(n)
        return max(l)
                

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        n = 0
        l=-1
        for i in range(len(nums)):
            if nums[i] == 1 and i!=len(nums)-1:
                n += 1
            elif nums[i] == 1 and i==len(nums)-1:
                l=max(l,n+1)
            else:
                if n>l:
                   l=n 
                n = 0
        if (l==-1):
            l=len(nums)
        return l

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        return max(len (substr) for substr in ''.join([str(x) for x in nums]).split("0"))

想到这个思路了，但是不会表达！！！
tips：