0485 - Max Consecutive Ones
Given a binary array nums, return the maximum number of consecutive 1's in the array.
Examples
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.
Input: nums = [1,0,1,1,0,1] Output: 2
Constraints
1 <= nums.length <= 105 nums[i] is either 0 or 1.
Java Solution
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int max = 0;
int currentMax = 0;
int index = 0;
while (index < nums.length) {
if(nums[index] == 1) {
currentMax++;
} else {
currentMax = 0;
}
index++;
max = Math.max(max, currentMax);
}
return max;
}
}
Last updated