1493.删掉一个元素以后全为 1 的最长子数组

class Solution {
    public int longestSubarray(int[] nums) {
        int n=nums.length;
        int count=0;
        int ans=0;
        for(int right=0,left=0;right<n;right++){
            count+=1-nums[right];
            while(count>1&&left<=right){
                count-=1-nums[left];
                left++;
            }
            ans = Math.max(ans,right-left);
        }
        return ans;
        
    }
}