LeetCode [485]

 485. Max Consecutive Ones

Easy

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14

class Solution { public int findMaxConsecutiveOnes(int[] nums) { int n = nums.length, i = 0, j = 0, maxL = 0; while(j<n){ if(nums[j]==1) j++; else{ maxL = Math.max(maxL, j-i); j++; i = j; } } return Math.max(maxL, j-i); } }