Leetcode 485. Max Consecutive Ones (Python)

Given a binary array nums, return the maximum number of consecutive 1's in the array.

Example 1:

Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

Constraints:

• 1 <= nums.length <= 105
• nums[i] is either 0 or 1.

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        list = []
        count = 0
        list = []
        for i in nums:
            if i == 1:
                count+=1
                list.append(count)
            elif i == 0:
                count = 0
                list.append(count)
                
        list.sort()
        
        number = int(list[-1])
        
        return number