485. Max Consecutive Ones

package LeetCode_485

/**
 * 485. Max Consecutive Ones
 * https://leetcode.com/problems/max-consecutive-ones/description/
 *
 * 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
 * */
class Solution {
    /*
    * Time complexity:O(n), Space complexity:O(1)
    * */
    fun findMaxConsecutiveOnes(nums: IntArray): Int {
        var count = 0
        var maxOneCount = 0
        for (num in nums) {
            if (num == 1) {
                count++
                maxOneCount = Math.max(count, maxOneCount)
            } else {
                count = 0
            }
        }
        return maxOneCount
    }
}