1493. Longest Subarray of 1’s After Deleting One Element

Given a binary array nums, you should delete one element from it.

Return the size of the longest non-empty subarray containing only 1’s in the resulting array. Return 0 if there is no such subarray.

class Solution {
public:
    int longestSubarray(vector<int>& A) {
        int l = 0, r = 0, n = A.size(), z = 0, res = 0;
        while(r < n) {
            while(r < n and z <= 1) {
                z += A[r++] == 0;
                if(z <= 1)
                    res = max(res, r - l - 1);
            }
            while(r < n and z > 1) {
                z -= A[l++] == 0;
            }
        }
        return res;
    }
};