Solved leetcode 485

Author: vaaranan-y

485/485.py

@@ -0,0 +1,14 @@
+class Solution:
+    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
+        maxConsec = 0
+        currConsec = 0
+        for num in nums:
+            if(num):
+                currConsec += 1
+            else:
+                maxConsec = max(maxConsec, currConsec)
+                currConsec = 0
+        
+        return max(maxConsec, currConsec)
+
+