Given a binary array, find the maximum number of consecutive 1s in this array.
Example:
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
这题非常简单,遍历一遍,记录一个当前连续的和最大连续的,遇到更新即可。
func findMaxConsecutiveOnes(nums []int) int {
var max, current int
for _, v := range nums {
if v == 1 {
current++
} else {
current = 0
}
if current > max {
max = current
}
}
return max
}