LeetCode题目-485

解法1

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:

        str_ = ‘‘
        for item in nums:
            str_ += str(item)

        li = str_.split(‘0‘)

        max = 0
        for item in li:
            if len(item) > max:
                max = len(item)
				
        return max

LeetCode题目-485

原文：https://www.cnblogs.com/gmbjzg/p/14610224.html