3. 无重复字符的最长子串

var lengthOfLongestSubstring = function(s) {
    let set = new Set()
    let i = 0, j = 0, maxLength = 0
    let length = s.length
    for(i; i<s.length;i++){
        if(!set.has(s[i])){
            set.add(s[i])
            maxLength = Math.max(set.size, maxLength)         
        }else{
            while(set.has(s[i])){
                set.delete(s[j])
                j++
            }
            set.add(s[i])
        }
    }
    return maxLength
};