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-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0401_0500.s0485_max_consecutive_ones;

// #Easy #Array #2022_07_21_Time_1_ms_(100.00%)_Space_43.6_MB_(84.46%)

/**
 * 485 - Max Consecutive Ones\.
 *
 * Easy
 *
 * Given a binary array `nums`, return _the maximum number of consecutive_ `1`_'s in the array_.
 *
 * **Example 1:**
 *
 * **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.
 *
 * **Example 2:**
 *
 * **Input:** nums = [1,0,1,1,0,1]
 *
 * **Output:** 2
 *
 * **Constraints:**
 *
 * *   1 <= nums.length <= 10⁵
 * *   `nums[i]` is either `0` or `1`.
**/
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;
    }
}