Solving Max Consecutive Ones in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem 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 length of input array is a positive integer and will not exceed 10,000

See the full details of the problem Max Consecutive Ones at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go