Time: 312 ms (33.71%), Space: 13.9 MB (35.42%) - LeetHub

max-consecutive-ones/max-consecutive-ones.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def findMaxConsecutiveOnes(self, nums):
+        count = int(0)
+        result = int(0)
+        n=len(nums)
+        for i in range (n):
+            if (nums[i]==0):
+                count=0
+            else:
+                count-=-1
+                result=max(count,result)
+        return result
+
+
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+