1493. the longest subarray with all 1 after deleting an element

1493. After deleting an element, it's all 1 Longest subarray of

Give you a binary array nums , You need to delete an element from it .

Please delete the element in the result array , Returns the longest and contains only 1 The length of the non empty subarray of .

If no such subarray exists , Please return 0 .

Tips 1：

Input ：nums = [1,1,0,1]
Output ：3
explain ： Delete position 2 After ,[1,1,1] contain 3 individual 1 .

Example 2：

Input ：nums = [0,1,1,1,0,1,1,0,1]
Output ：5
explain ： Delete position 4 After the number of ,[0,1,1,1,1,1,0,1] Maximum length of 1 Subarray is [1,1,1,1,1] .

Example 3：

Input ：nums = [1,1,1]
Output ：2
explain ： You have to delete an element .

This question is also simple , Let's just do it as usual , In fact, you need to traverse the question data . then , Every time I hit a zero , We all make an elimination judgment , Then we can find the optimal solution , The solution code is as follows ：

int longestSubarray(int* nums, int numsSize){
    
    int max=0;
    int num=0;
    int i;
    int pre=0;
    int r=0;
    for(i=0;i<numsSize;i++){
    
        if(nums[i]==1){
    
            num++;
        }
        if(nums[i]==0){
    
            r=1;
            if(num+pre>max){
    
                max=num+pre;
            }
            pre=num;
             num=0;
        }
    }
    if(nums[numsSize-1]==1){
    
          if(num+pre>max){
    
                max=num+pre;
            }

    }
    if(r==0){
    
        return num-1;
    }
   
    return max;

}