<p>Given a binary array <code>nums</code>, return <em>the maximum number of consecutive </em><code>1</code><em>&#39;s in the array</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,0,1,1,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,0,1,1,0,1]
<strong>Output:</strong> 2
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& arr) {
        vector<int> counter;
        
        int c = 1; 
        if(arr.size() <= 1 &&arr[0]==1) return 0+1;
        if(arr.size()<=1 &&arr[0]==0) return 0;
        if(arr[0] == 0 && arr[1]==1 && arr.size() == 2)
            return 1;
        int found = 0;
        for(int i= 0;i<=arr.size()-2;i++)
        {
            if(arr[i]==1)
            {
                found = 1;
            if(arr[i]==arr[i+1])
            {
                c+=1;
            }
            else
            {
                counter.push_back(c);
                c= 1;
                
            }
            }
        }
        if(found)
            counter.push_back(c);
        int maxi =0;
        for(auto it :counter)
        {
            cout << it<<endl;
            maxi = max(maxi,it);
        } 
        return maxi;
    }
};
39100