5.7.23(1493. Longest Subarray of 1's After Deleting One Element(Medium))

class Solution {
public:
    int longestSubarray(vector<int>& nums)
    {
       int zero_ind = -1;
       int count0 = 0;
       int ans = 0;

       int i = 0,j = 0;
       while(j < nums.size())
       {
           if(nums[j] == 0) 
           {
               count0++;
               if(count0 > 1)
               {
                   i = zero_ind+1;
                   count0--;
               } 
               zero_ind = j;
           }
           ans = max(ans,j-i);
           j++;
       } 
       return ans;
    }
};