Max Consecutive Ones

#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.


#Java

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        
        int count = 0;
        int result = 0;
      
        for (int i = 0; i < nums.length; i++)
        {
            if (nums[i] == 0)
                count = 0;
            else
            {
                count++;
                result = Math.max(result, count);
            }
        }
      
        return result;

#Python 3

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        count = 0
        result = 0
        for i in nums:
            if i == 0:
                count = 0
            else:
                count+=1
                result = max(result,count)
        return result