Code: class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: g=""; for i in nums: g=g+str(i); e=g.split('0'); max=0; for i in e: if(max<len(i)): max=len(i); return max;
Max Consecutive Ones | Python
Code: class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: g=""; for i in nums: g=g+str(i); e=g.split('0'); max=0; for i in e: if(max<len(i)): max=len(i); return max;

