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.
​

解題

func findMaxConsecutiveOnes(nums []int) int {
max := 0
count := 0
for i, v := range(nums) {
if v==1 {
count++
if i==len(nums)-1 || nums[i+1]==0 {
if count>max {
max = count
}
count = 0
}
}
}
return max
}