GoLang Solution For LeetCode Problem: Max Consecutive Ones
Solving Max Consecutive Ones in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a binary array, find the maximum number of consecutive 1s in this array.
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.
- 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