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

class Solution {
    public int longestSubarray(int[] nums) {
        int last = 0;
        int cur = 0;
        int res = 0;
        int flag = 0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]==1){
                cur += 1;
            }else{
                last = cur;
                cur = 0;
                flag = 1;
            }
            if(cur+last>res){
                res = cur+last;
            }
        }
        return flag==0?nums.length-1:res;
    }
}