LeetCode in Kotlin

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 <= 105
• nums[i] is either 0 or 1.

Solution

class Solution {
    fun findMaxConsecutiveOnes(nums: IntArray): Int {
        var maxLen = 0
        var i = 0
        while (i < nums.size) {
            var currentLen = 0
            while (i < nums.size && nums[i] == 1) {
                i++
                currentLen++
            }
            maxLen = Math.max(maxLen, currentLen)
            i++
        }
        return maxLen
    }
}

This site is open source. Improve this page.