CREATE USER ‘wordpress_user’@‘localhost’ IDENTIFIED BY ‘P@55word’;·

GRANT ALL PRIVILEGES ON wordpress_db.* TO ‘wordpress_user’@‘localhost’;

class Solution {
public:
    int longestSubarray(vector&LTint>& nums) {
        int n = nums.size();
        int ans = 0;
        int count = 0;

        for(int l = 0, r = 0; r < n; r++) {
            count += 1 - nums[r];
            while (count > 1) {
                count -= 1 - nums[l++];
            }
            ans = max(ans, r - l);
        }
        return ans;
     }
};

因为使用if的话，l和r指针会一起移动，在这种情况下，因为最后的答案是Max，所以不会影响结果，但是中间值其实不一定是题目所要求的子数组的（即超过了1个0）

class Solution {
public:
    int longestSubarray(vector&LTint>& nums) {
        int n = nums.size();
        int ans = 0;
        int count = 0;

        for(int l = 0, r = 0; r < n; r++) {
            count += 1 - nums[r];
            if (count > 1) {
                count -= 1 - nums[l++];
            }
            ans = max(ans, r - l);
        }
        return ans;
     }
};