LeetCode： Max Consecutive Ones

Question

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 input array will only contain 0 and 1.

The length of input array is a positive integer and will not exceed 10,000

Solution

def find_max_consecutive_ones(nums)
  ones_array = nums.join.to_s.split('0')
  if ones_array.empty?
    return 0
  else
    ones_array.max.length
  end
end