package com.fishercoder.solutions;

/**
 * Given a binary array, find the maximum number of consecutive 1s in this array.

 Example 1:
 Input: [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.
 Note:

 The input array will only contain 0 and 1.
 The length of input array is a positive integer and will not exceed 10,000
 */
public class _487 {

    public static int findMaxConsecutiveOnes(int[] nums) {
        int maxOnes = 0;
        for (int i = 0; i < nums.length; i++) {
            int newOnes = 0;
            while (i < nums.length && nums[i] == 1) {
                newOnes++;
                i++;
            }
            maxOnes = Math.max(maxOnes, newOnes);
        }
        return maxOnes;
    }

}

@@ -33,396 +33,8 @@
 s;%0A%0A
-/**%0A * Given a binary array, find the maximum number of consecutive 1s in this array.%0A%0A Example 1:%0A Input: %5B1,1,0,1,1,1%5D%0A Output: 3%0A Explanation: The first two digits or the last three digits are consecutive 1s.%0A The maximum number of consecutive 1s is 3.%0A Note:%0A%0A The input array will only contain 0 and 1.%0A The length of input array is a positive integer and will not exceed 10,000%0A */%0A
 publ

refactor 487