g0401_0500.s0485_max_consecutive_ones.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0401_0500.s0485_max_consecutive_ones;
// #Easy #Array
public class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int maxLen = 0;
int i = 0;
while (i < nums.length) {
int currentLen = 0;
while (i < nums.length && nums[i] == 1) {
i++;
currentLen++;
}
maxLen = Math.max(maxLen, currentLen);
i++;
}
return maxLen;
}
}