Longest Subarray of 1's After Deleting One Element

LeetCode題目: 1493. Longest Subarray of 1’s After Deleting One Element

My solution:

/**
 * @param {number[]} nums
 * @return {number}
 */
let longestSubarray = nums => {
    let left = 0, right = 0, remove = 1, maxLen = 0;
    while(right < nums.length) {
        if(nums[right] === 0) --remove;
        if(remove < 0 && nums[left++] === 0) ++remove;
        maxLen = Math.max(maxLen, right - left);
        ++right;
    }
    return maxLen;
};