485. Max Consecutive Ones

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

c++ Soulution:

```

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int max=0,current=0;
        for(int i=0;i<nums.size();i++)
            if(nums[i]==1){
                current++;
                if(current>max)max=current;
            }
        else{
            current=0;
        }
        return max;
    }
};

 ```

Python Solution:

```

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums = list(nums)
        max = 0
        current = 0
        for i in nums:
            if i==1:
                current += 1
                if current > max:
                    max = current
            else:
                current = 0
        return max

```