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

---

题目链接：1493. 删掉一个元素以后全为 1 的最长子数组

代码如下：

class Solution 
{
public://滑动窗口int longestSubarray(vector<int>& nums){int res = 0;int count = 0;//记录碰到0的个数int left = 0, right = 0;while (right < nums.size()){if (nums[right] == 0) { count++; }right++;while (count > 1){if (nums[left] == 0) { count--; }left++;}res = max(res, right - left - 1);}return res;}
};