#LeetCode# I have solved Max Consecutive Ones. Come and join the fun!

#LeetCode# I have solved Max Consecutive Ones. Come and join the fun!: LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore.

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.