[LeetCode] Problem 485 - Max Consecutive Ones

Posted on | In ,

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

Example

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

Code

1
2
3
4
5
6
7
8
9
10
11
public int findMaxConsecutiveOnes(int[] nums) {
    int max = 0;
    int count = 0;

    for (int num : nums) {
        count = (num == 0) ? 0 : count + 1;
        max = Math.max(max, count);
    }

    return max;
}