无重复字符的最长子串

/**
 * @param {string} s
 * @return {number}
 */
var lengthOfLongestSubstring = function(s) {
    let left = right = length = maxLength = 0;
    let set = new Set();
    while(right < s.length){
        if(!set.has(s[right])){
            set.add(s[right])
            length++;
            if(length > maxLength){
                maxLength = length;
            }
            right++;
        }else{
            while(set.has(s[right])){
                set.delete(s[left]);
                left++;
                length--;
            }
            set.add(s[right]);
            length++;
            right++;
        }

       
    }
    return maxLength;

};