<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>& nums) {
        int l = 0;
        int r = 0;
        int ans = 0;
        int ones = 0;
        int zeros = 0;
        while(r < nums.size())
        {
            if(nums[r] == 1) ones++;
            else zeros++;
            while(zeros > 0)
            {
                if(nums[l] == 1) ones--;
                else zeros--;
                l++;
            }
            ans = max(ans, ones);
            r++;
        }
        return ans;
    }
};
auto init = []
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ofstream out("user.out");
    cout.rdbuf(out.rdbuf());
    return 'c';
}();
39000