| https://leetcode.com/problems/max-consecutive-ones | Easy |
|---|
class Solution {
fun findMaxConsecutiveOnes(nums: IntArray): Int {
var best = 0
var cur = 0
var i = 0
val n = nums.size
while (i < n) {
if (nums[i] == 1) {
cur++
if (cur > best) best = cur
} else {
cur = 0
}
i++
}
return best
}
}