let lengthOfLongSubstring = function(str){
let n = str.length
let left = 0;
let right = -1;
let freqMap = {} // 记录当前字串中现啊对应的出现频率
let max = 0 // 找到的满足条件字串的最长长度
while(left<n){
let nextLetter = str[right + 1]
if(!freqMap[nextLetter] && nextLetter !== undefined){
freqMap[nextLetter] = 1
right ++
}else{
freqMap[nextLetter] = 0
left ++
}
max = Math.max(max,right-left+1)
}
return max
}
let str = 'wedwedwe' // 随机写一个字符串
lengthOfLongSubstring(str)