Longest Subarray of 1's After Deleting One Element

class Solution {
public:
    int longestSubarray(vector<int>& nums) {
         int i,j,m=0;
        vector<int>v;
        v.push_back(-1);
        for(i=0;i<nums.size();i++){
            if(nums[i]==0)
            v.push_back(i);
        }
        v.push_back(i);

        for(i=1;i<v.size()-1;i++){
            m=max(m,v[i+1]-v[i-1]-2);
        }
        if(v.size()==2)
        return nums.size()-1;

        return m;

    }
};