Class Solution


  • public class Solution
    extends Object
    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`.
    • Constructor Detail

      • Solution

        public Solution()
    • Method Detail

      • findMaxConsecutiveOnes

        public int findMaxConsecutiveOnes​(int[] nums)